1639 search results - page 77 / 328 » Anytime Heuristic Search |
102
click to vote
IBERAMIA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
EVOW
2009
Springer
15 years 7 months ago
2009
Springer
The problem of finding a symmetric connectivity topology with minimum power consumption in a wireless ad-hoc network is NPhard. This work presents a new iterated local search to s...
INFORMATICALT
2006
15 years 16 days ago
2006
Given a set of objects with profits (any, even negative, numbers) assigned not only to separate objects but also to pairs of them, the unconstrained binary quadratic optimization p...
109
click to vote
AAAI
2000
15 years 1 months ago
2000
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...
106
click to vote
IJAMCIGI
2010
14 years 9 months ago
2010
Hyper-heuristics are identified as the methodologies that search the space generated by a finite set of low level heuristics for solving difficult problems. One of the iterative h...