Now showing items 1-10 of 343
Improved analysis of a max-cut algorithm based on spectral partitioning
Trevisan [SIAM J. Comput., 41 (2012), pp. 1769-1786] presented an algorithm for Max-Cut based on spectral partitioning techniques. This is the first algorithm for Max-Cut with an approximation guarantee strictly larger ...
A Relax-and-Cut algorithm for the set partitioning problem
(Pergamon-elsevier Science LtdOxfordInglaterra, 2008)
An Application of Fuzzy Logic for Hardware/Software Partitioning in Embedded Systems
(Computación y Sistemas; Vol. 17 No. 1, 2013-03-06)
Abstract: Hardware/Software partitioning (HSP) is a key task for embedded system co-design. The main goal of this task is to decide which components of an application are to be executed in a general purpose processor ...
Optimal rectangular partitions
(John Wiley & Sons IncHobokenEUA, 2003)
Exact solutions of rectangular partitions via integer programming
(World Scientific Publ Co Pte LtdSingaporeSingapura, 2000)
Finding H-partitions efficiently
(E D P SciencesLes Ulis Cedex AFrança, 2005)
A formalized optimum code search for q-ary trellis codes
(Institute of Electrical and Electronics Engineers (IEEE), 1997-01-01)
This paper gives a formalization for q-ary codes of the search algorithm  for optimum codes based on lattices and cosets . With a more efficient and an automated algorithm it also has been possible to extend the ...
Clique partitioning with value-monotone submodular cost
We consider the problem of partitioning a graph into cliques of bounded cardinality. The goal is to find a partition that minimizes the sum of clique costs where the cost of a clique is given by a set function on the nodes. ...
The node capacitated graph partitioning problem: A computational study
(SpringerNew YorkEUA, 1998)