2412 search results - page 226 / 483 » Which Problems Have Strongly Exponential Complexity |
123
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
155
click to vote
PPSN
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
122
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polyn...
108
click to vote
ENC
2003
IEEE
15 years 9 months ago
2003
IEEE
Several lossless data compression schemes have been proposed over the past years. Since Shannon developed information theory in his seminal paper, however, the problem of data com...
130
click to vote
COMBINATORICS
2007
15 years 3 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...