604 search results - page 34 / 121 » On the Complexity of the Maximum Cut Problem |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
This paper presents a new method for 3D cutting of geometrical space with application to airspace sectoring. This problem comes from the air traffic management but the proposed me...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
CORR
2008
Springer
14 years 8 months ago
2008
Springer
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
119
click to vote
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...