Sciweavers

5263 search results - page 184 / 1053
» Optimization with Extremal Dynamics
Sort
View
EUROGP
1998
Springer
15 years 3 months ago
Immediate Transfer of Global Improvements to All Individuals in a Population Compared to Automatically Defined Functions for the
Koza has shown how automatically defined functions (ADFs) can reduce computational effort in the GP paradigm. In Koza's ADF, as well as in standard GP, an improvement in a par...
Ricardo Aler
AAAI
2004
15 years 23 days ago
Solving Concurrent Markov Decision Processes
Typically, Markov decision problems (MDPs) assume a single action is executed per decision epoch, but in the real world one may frequently execute certain actions in parallel. Thi...
Mausam, Daniel S. Weld
CADE
2009
Springer
15 years 12 months ago
An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability for propositional dynamic logic. Our main contribution is a sound meth...
Florian Widmann, Rajeev Goré
SAC
2010
ACM
15 years 6 months ago
Reachability analysis of GSPDIs: theory, optimization, and implementation
Analysis of systems containing both discrete and continuous dynamics, hybrid systems, is a difficult issue. Most problems have been shown to be undecidable in general, and decidab...
Hallstein Asheim Hansen, Gerardo Schneider
CDC
2008
IEEE
107views Control Systems» more  CDC 2008»
15 years 5 months ago
Locally optimal decomposition for autonomous obstacle avoidance with the Tunnel-MILP algorithm
— The Tunnel-MILP algorithm is a three stage path planning method for 2-D environments that relies on the identification of a sequence of convex polygons to form an obstacle fre...
Michael P. Vitus, Steven Lake Waslander, Claire J....