9842 search results - page 1420 / 1969 » The Complexity of the Matching-Cut Problem |
199
click to vote
CP
2007
Springer
16 years 1 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
198
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
192
click to vote
FOCS
2006
IEEE
16 years 1 months ago
2006
IEEE
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
213
click to vote
ICRA
2006
IEEE
16 years 1 months ago
2006
IEEE
— The dangerous and time sensitive nature of a disaster area makes it an ideal application for robotic exploration. Our long term goal is to enable humans, software agents, and a...
182
click to vote
INFOCOM
2006
IEEE
16 years 1 months ago
2006
IEEE
— Traditional network routing uses the single (shortest) path paradigm. This paradigm leaves the session vulnerable to a variety of security threats, such as eavesdropping. We pr...