Sciweavers

519 search results - page 40 / 104
» A Meta-CSP Model for Optimal Planning
Sort
View
PRIMA
2007
Springer
14 years 3 months ago
Multiagent Planning with Trembling-Hand Perfect Equilibrium in Multiagent POMDPs
Multiagent Partially Observable Markov Decision Processes are a popular model of multiagent systems with uncertainty. Since the computational cost for finding an optimal joint pol...
Yuichi Yabu, Makoto Yokoo, Atsushi Iwasaki
APWEB
2010
Springer
14 years 1 months ago
Optimizing Query Processing for the Hidden Web
Abstract. The term Deep Web (sometimes also called Hidden Web) refers to the data content that is created dynamically as the result of a specific search on the Web. In this respec...
Andrea Calì, Davide Martinenghi
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
14 years 3 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
ATAL
2000
Springer
14 years 1 months ago
Planning-Task Transformations for Soft Deadlines
Agents often have preference models that are more complicated than minimizing the expected execution cost. In this paper, we study how they should act in the presence of uncertaint...
Sven Koenig
ECIS
2003
13 years 10 months ago
The value of cooperative planning in supply chains. A simulative approach
In this paper we examine, how the benefits of Supply Chain Management, as announced by the literature and widely accepted, can simulatively be proven. We first present selected re...
Luis Martín Díaz, Peter Buxmann