225 search results - page 9 / 45 » A Least-Certainty Heuristic for Selective Search |
DEXA
1995
Springer
15 years 1 months ago
1995
Springer
Abstract. The object-oriented database management systems store references to objects (implicit joins, precomputed joins), and use path expressions in query languages. One way of e...
85
Voted
ECAI
2004
Springer
15 years 2 months ago
2004
Springer
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
100
Voted
HEURISTICS
1998
14 years 9 months 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...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
In this paper, we describe how a genetic algorithm approach added to a simulated annealing (SA) process offers a better alternative to find the mean variance frontier in the portf...
94
Voted
FLAIRS
2007
14 years 12 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...