Sciweavers

147 search results - page 3 / 30
» How an optimal observer can collapse the search space
Sort
View
ICTAI
2005
IEEE
14 years 15 days ago
Planning with POMDPs Using a Compact, Logic-Based Representation
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...
Chenggang Wang, James G. Schmolze
BC
2005
101views more  BC 2005»
13 years 6 months ago
A control theory approach to the analysis and synthesis of the experimentally observed motion primitives
Recent experiments on frogs and rats, have led to the hypothesis that sensory-motor systems are organized into a finite number of linearly combinable modules; each module generates...
Francesco Nori, Ruggero Frezza
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
13 years 10 months ago
"Optimal" mutation rates for genetic search
Using a set of model landscapes we examine how different mutation rates affect different search metrics. We show that very universal heuristics, such as 1/N and the error threshol...
Jorge Cervantes, Christopher R. Stephens
ECP
1997
Springer
103views Robotics» more  ECP 1997»
13 years 11 months ago
Plan-Refinement Strategies and Search-Space Size
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which ref...
Reiko Tsuneto, Dana S. Nau, James A. Hendler
CGO
2007
IEEE
14 years 1 months ago
Evaluating Heuristic Optimization Phase Order Search Algorithms
Program-specific or function-specific optimization phase sequences are universally accepted to achieve better overall performance than any fixed optimization phase ordering. A ...
Prasad Kulkarni, David B. Whalley, Gary S. Tyson