1614 search results - page 75 / 323 » Breadth-First Heuristic Search |
114
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
127
click to vote
IBERAMIA
2004
Springer
15 years 9 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...
123
click to vote
EVOW
2009
Springer
15 years 10 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...
132
click to vote
INFORMATICALT
2006
15 years 4 months 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...
139
click to vote
AAAI
2000
15 years 5 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...