1639 search results - page 89 / 328 » Anytime Heuristic Search |
95
Voted
HAIS
2009
Springer
15 years 5 months ago
2009
Springer
The hybridization of heuristics methods aims at exploring the synergies among stand alone heuristics in order to achieve better results for the optimization problem under study. In...
80
Voted
DATE
2004
IEEE
15 years 4 months ago
2004
IEEE
The power consumed by the memory hierarchy of a microprocessor can contribute to as much as 50% of the total microprocessor system power, and is thus a good candidate for optimiza...
125
click to vote
HEURISTICS
1998
15 years 8 days ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
123
click to vote
FLAIRS
2007
15 years 2 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
ESA
2008
Springer
15 years 2 months ago
2008
Springer
The focus is on black-box optimization of a function f : RN R given as a black box, i. e. an oracle for f-evaluations. This is commonly called direct search, and in fact, most meth...