Sciweavers

655 search results - page 38 / 131
» Evolving Heuristics for Planning
Sort
View
AIPS
2010
15 years 2 months ago
The Joy of Forgetting: Faster Anytime Search via Restarting
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
Silvia Richter, Jordan Tyler Thayer, Wheeler Ruml
AAAI
2008
15 years 2 months ago
Planning with Problems Requiring Temporal Coordination
We present the first planner capable of reasoning with both the full semantics of PDDL2.1 (level 3) temporal planning and with numeric resources. Our planner, CRIKEY3, employs heu...
Andrew Coles, Maria Fox, Derek Long, Amanda Smith
CORR
2007
Springer
144views Education» more  CORR 2007»
14 years 11 months ago
Heuristics for Network Coding in Wireless Networks
Multicast is a central challenge for emerging multi-hop wireless architectures such as wireless mesh networks, because of its substantial cost in terms of bandwidth. In this artic...
Song Yean Cho, Cedric Adjih, Philippe Jacquet
JUCS
2008
132views more  JUCS 2008»
14 years 11 months ago
Testing Website Usability in Spanish-Speaking Academia through Heuristic Evaluation and Cognitive Walkthroughs
: Although usability evaluations have been focused on assessing different contexts of use, no proper specifications have been addressed towards the particular environment of academ...
María Paula González, Toni Granoller...
JAIR
2006
120views more  JAIR 2006»
14 years 11 months ago
FluCaP: A Heuristic Search Planner for First-Order MDPs
We present a heuristic search algorithm for solving first-order Markov Decision Processes (FOMDPs). Our approach combines first-order state abstraction that avoids evaluating stat...
Steffen Hölldobler, Eldar Karabaev, Olga Skvo...