Sciweavers

1101 search results - page 45 / 221
» heuristics 2007
Sort
View
AIPS
2007
13 years 10 months ago
Structural Patterns of Tractable Sequentially-Optimal Planning
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...
Michael Katz, Carmel Domshlak
HEURISTICS
2007
76views more  HEURISTICS 2007»
13 years 7 months ago
Metaheuristics can solve sudoku puzzles
: In this paper we present, to our knowledge, the first application of a metaheuristic technique to the very popular and NP-complete puzzle known as ‘sudoku’. We see that this ...
Rhyd Lewis
CEC
2007
IEEE
14 years 2 months ago
An investigation of hyper-heuristic search spaces
— Hyper-heuristics or “heuristics that coordinate heuristics” are fastly becoming popular for solving combinatorial optimisation problems. These methods do not search directl...
José Antonio Vázquez Rodrígue...
ATVA
2007
Springer
118views Hardware» more  ATVA 2007»
14 years 1 months ago
Pruning State Spaces with Extended Beam Search
This paper focuses on using beam search, a heuristic search algorithm, for pruning state spaces while generating. The original beam search is adapted to the state space generation ...
Muhammad Torabi Dashti, Anton Wijs
IPL
2007
74views more  IPL 2007»
13 years 7 months ago
Nonnegative integral subset representations of integer sets
We consider an integer-subset representation problem motivated by a medical application in radiation therapy. We prove NP-completeness, derive nontrivial bounds, and report on the...
Michael J. Collins, David Kempe, Jared Saia, Maxwe...