2430 search results - page 420 / 486 » Computing Tutte Polynomials |
196
Voted
AIPS
2011
14 years 6 months ago
2011
We define a probe to be a single action sequence computed greedily from a given state that either terminates in the goal or fails. We show that by designing these probes carefull...
156
Voted
GECCO
2011
Springer
14 years 6 months ago
2011
Springer
When the epistasis of the fitness function is bounded by a constant, we show that the expected fitness of an offspring of the (1+1)-EA can be efficiently computed for any point...
123
Voted
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
194
Voted
CP
2011
Springer
14 years 2 months ago
2011
Springer
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
132
Voted
BMVC
2001
15 years 5 months ago
2001
The ability to construct CAD or other object models from edge and range data has a fundamental meaning in building a recognition and positioning system. While the problem of model...