Sciweavers

3038 search results - page 95 / 608
» Controlling Engineering Problem Solving
Sort
View
UAI
2000
13 years 10 months ago
The Complexity of Decentralized Control of Markov Decision Processes
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...
Daniel S. Bernstein, Shlomo Zilberstein, Neil Imme...
AI
1999
Springer
13 years 8 months ago
Learning Action Strategies for Planning Domains
There are many different approaches to solving planning problems, one of which is the use of domain specific control knowledge to help guide a domain independent search algorithm. ...
Roni Khardon
HYBRID
1999
Springer
14 years 1 months ago
As Soon as Possible: Time Optimal Control for Timed Automata
In this work we tackle the following problem: given a timed automaton, and a target set F of configurations, restrict its transition relation in a systematic way so that from ever...
Eugene Asarin, Oded Maler
AUTOMATICA
2011
13 years 4 months ago
Distributed dynamic programming for discrete-time stochastic control, and idempotent algorithms
Previously, idempotent methods have been found to be extremely fast for solution of dynamic programming equations associated with deterministic control problems. The original meth...
William M. McEneaney
GECCO
2003
Springer
106views Optimization» more  GECCO 2003»
14 years 2 months ago
Taming a Flood with a T-CUP - Designing Flood-Control Structures with a Genetic Algorithm
This paper describes the use of a genetic algorithm to solve a hydrology design problem - determining an optimal or near-optimal prescription of Best Management Practices in a flo...
Jeff Wallace, Sushil J. Louis