1933 search results - page 149 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
187
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
195
click to vote
IM
2007
15 years 6 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
145
click to vote
AAAI
2004
15 years 8 months ago
2004
This paper addresses the question of allocating computational resources among a set of algorithms in order to achieve the best performance on a scheduling problem instance. Our pr...
168
click to vote
FLAIRS
2003
15 years 8 months ago
2003
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
161
click to vote
IJCGA
2002
15 years 6 months ago
2002
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...