Sciweavers

30 search results - page 2 / 6
» Plan-Refinement Strategies and Search-Space Size
Sort
View
CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 5 months ago
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpos...
Thanasis Balafoutis, Kostas Stergiou
KES
2004
Springer
13 years 10 months ago
Planning with Recursive Subgoals
In this paper, we introduce an effective strategy for subgoal division and ordering based upon recursive subgoals and combine this strategy with a genetic-based planning approach....
Han Yu, Dan C. Marinescu, Annie S. Wu, Howard Jay ...
GECCO
2009
Springer
150views Optimization» more  GECCO 2009»
13 years 10 months ago
Benchmarking a BI-population CMA-ES on the BBOB-2009 function testbed
We propose a multistart CMA-ES with equal budgets for two interlaced restart strategies, one with an increasing population size and one with varying small population sizes. This B...
Nikolaus Hansen
ML
2008
ACM
13 years 5 months ago
Layered critical values: a powerful direct-adjustment approach to discovering significant patterns
Standard pattern discovery techniques, such as association rules, suffer an extreme risk of finding very large numbers of spurious patterns for many knowledge discovery tasks. The...
Geoffrey I. Webb
EWCBR
2008
Springer
13 years 7 months ago
Real-Time Plan Adaptation for Case-Based Planning in Real-Time Strategy Games
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
Neha Sugandh, Santiago Ontañón, Ashw...