Sciweavers

160 search results - page 6 / 32
» Planning Graph Heuristics for Belief Space Search
Sort
View
AIPS
2006
15 years 7 months ago
Automated Web Service Composition by On-the-Fly Belief Space Search
Composition of stateful web services expressed in BPEL4WS can be recasted as a problem of planning in asynchronous domains. In (PTB05), this is pursued by encoding the asynchronou...
Piergiorgio Bertoli, Marco Pistore, Paolo Traverso
COR
2010
146views more  COR 2010»
15 years 6 months ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
AAAI
2006
15 years 7 months ago
Planning with First-Order Temporally Extended Goals using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. The problem of planning with TEGs is of renewed interest becau...
Jorge A. Baier, Sheila A. McIlraith
AIPS
2006
15 years 7 months ago
Planning with Temporally Extended Goals Using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. Current planners for TEGs prune the search space during planni...
Jorge A. Baier, Sheila A. McIlraith