Sciweavers

693 search results - page 52 / 139
» Complexity Analysis of Heuristic CSP Search Algorithms
Sort
View
116
Voted
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
15 years 10 months ago
Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
Steffen Christensen, Franz Oppacher
156
Voted
AAAI
2004
15 years 5 months ago
Forward-Chaining Planning in Nondeterministic Domains
In this paper, we present a general technique for taking forward-chaining planners for deterministic domains (e.g., HSP, TLPlan, TALplanner, and SHOP2) and adapting them to work i...
Ugur Kuter, Dana S. Nau
GECCO
2007
Springer
182views Optimization» more  GECCO 2007»
15 years 10 months ago
An analysis of the effects of population structure on scalable multiobjective optimization problems
Multiobjective evolutionary algorithms (MOEA) are an effective tool for solving search and optimization problems containing several incommensurable and possibly conflicting objec...
Michael Kirley, Robert L. Stewart
129
Voted
AAAI
2006
15 years 5 months ago
Exploring GnuGo's Evaluation Function with a SVM
While computers have defeated the best human players in many classic board games, progress in Go remains elusive. The large branching factor in the game makes traditional adversar...
Christopher Fellows, Yuri Malitsky, Gregory Wojtas...
125
Voted
ACE
2004
182views Education» more  ACE 2004»
15 years 5 months ago
Learning to Program: Spreadsheets, Scripting and HCI
An examination of some recent programming texts indicates that the complexities of modern programming languages and environments have replaced the study of algorithms and programm...
Peter Warren