Sciweavers

1529 search results - page 9 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
FOGA
2011
12 years 11 months ago
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Greg Durrett, Frank Neumann, Una-May O'Reilly
AIPS
2006
13 years 9 months ago
Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
Mark F. Rogers, Adele E. Howe, Darrell Whitley
PUK
2000
13 years 9 months ago
On the Instantiation of ADL Operators Involving Arbitrary First-Order Formulas
The generation of the set of all ground actions for a given set of ADL operators, which are allowed to have conditional effects and preconditions that can be represented using arbi...
Jana Koehler, Jörg Hoffmann
CORR
2002
Springer
83views Education» more  CORR 2002»
13 years 7 months ago
Optimal Ordered Problem Solver
We introduce a general and in a certain sense time-optimal way of solving one problem after another, efficiently searching the space of programs that compute solution candidates, i...
Jürgen Schmidhuber
IROS
2007
IEEE
189views Robotics» more  IROS 2007»
14 years 1 months ago
Differential evolution approach to the grid-based localization and mapping problem
— A new solution to the Simultaneous Localization and Modelling problem is presented. It is based on the stochastic search of solutions in the state space to the global localizat...
Luis Moreno, Santiago Garrido, Fernando Martin, Ma...