20 search results - page 2 / 4 » Search for Compromise Solutions in Multiobjective State Spac... |
AAAI
2000
13 years 7 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...
AAAI
2004
13 years 7 months ago
2004
Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by ...
CIKM
2010
Springer
13 years 4 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
EMO
2001
Springer
13 years 10 months ago
2001
Springer
One common characterization of how simple hill-climbing optimization methods can fail is that they become trapped in local optima - a state where no small modi cation of the curren...
EURODAC
1994
IEEE
13 years 10 months ago
1994
IEEE
Abstract -- A general framework for synthesis of asynchronous control circuits at the state graph level is proposed. The framework can consider both concurrency reduction as well a...