Sciweavers

213 search results - page 29 / 43
» Heuristics for Planning with Action Costs
Sort
View
CP
2005
Springer
14 years 29 days ago
Search and Inference in AI Planning
While Planning has been a key area in Artificial Intelligence since its beginnings, significant changes have occurred in the last decade as a result of new ideas and a more estab...
Hector Geffner
ICDE
2010
IEEE
211views Database» more  ICDE 2010»
14 years 2 months ago
ROX: The robustness of a run-time XQuery optimizer against correlated data
— We demonstrate ROX, a run-time optimizer of XQueries, that focuses on finding the best execution order of XPath steps and relational joins in an XQuery. The problem of join or...
Riham Abdel Kader, Peter A. Boncz, Stefan Manegold...
EOR
2008
95views more  EOR 2008»
13 years 7 months ago
Augmenting the lot sizing order quantity when demand is probabilistic
In this paper we consider a single item, discrete time, lot sizing situation where demand is random and its parameters (e.g., mean and standard deviation) can change with time. Fo...
I. Nyoman Pujawan, Edward A. Silver
DSN
2006
IEEE
14 years 1 months ago
Automatic Recovery Using Bounded Partially Observable Markov Decision Processes
This paper provides a technique, based on partially observable Markov decision processes (POMDPs), for building automatic recovery controllers to guide distributed system recovery...
Kaustubh R. Joshi, William H. Sanders, Matti A. Hi...
ISCC
2000
IEEE
104views Communications» more  ISCC 2000»
13 years 12 months ago
Dynamic Routing and Wavelength Assignment Using First Policy Iteration
With standard assumptions the routing and wavelength assignment problem (RWA) can be viewed as a Markov Decision Process (MDP). The problem, however, defies an exact solution bec...
Esa Hyytiä, Jorma T. Virtamo