Sciweavers

4962 search results - page 506 / 993
» Stochastic Model Checking
Sort
View
IJCAI
2001
15 years 6 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
IJCAI
1997
15 years 5 months ago
Learning Topological Maps with Weak Local Odometric Information
cal maps provide a useful abstraction for robotic navigation and planning. Although stochastic mapscan theoreticallybe learned using the Baum-Welch algorithm,without strong prior ...
Hagit Shatkay, Leslie Pack Kaelbling
WSC
2000
15 years 5 months ago
Product-mix analysis with Discrete Event Simulation
Discrete Event Simulation (DES) has been used as a design and validation tool in various production and business applications. DES can also be utilized for analyzing the product-m...
Raid Al-Aomar
119
Voted
WSC
1997
15 years 5 months ago
Searching for Important Factors: Sequential Bifurcation under Uncertainty
The problem of searching for important factors in a simulation model is considered when the simulation output is subject to stochastic variation. Bettonvil and Kleijnen (1996) giv...
Russell C. H. Cheng
SWARM
2008
SPRINGER
222views Optimization» more  SWARM 2008»
15 years 4 months ago
Biologically inspired redistribution of a swarm of robots among multiple sites
We present a biologically inspired approach to the dynamic assignment and reassignment of a homogeneous swarm of robots to multiple locations, which is relevant to applications lik...
M. Ani Hsieh, Ádám M. Halász,...