1176 search results - page 56 / 236 » Implicit Abstraction Heuristics |
CPAIOR
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. This paper furthers the recent investigation of search heuristics based on solution counting information, by proposing and evaluating algorithms to compute solution densi...
SODA
2012
ACM
12 years 11 days ago
2012
ACM
ABSTRACT∗ Arman Yousefi† Neal E. Young‡ Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of e...
CEC
2008
IEEE
14 years 4 months ago
2008
IEEE
Abstract— This paper explores the idea of neutrality in heuristic optimization algorithms. In particular, the effect of having multiple levels of neutrality in representations is...
WG
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
ICRA
2006
IEEE
14 years 4 months ago
2006
IEEE
Abstract— This paper studies the effect of communicationlink weighting schemes and long-range connections in speeding convergence to consensus on the average of the inputs to age...