Sciweavers

623 search results - page 108 / 125
» Planning with an Adaptive World Model
Sort
View
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
15 years 11 months ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner
ICDE
2005
IEEE
123views Database» more  ICDE 2005»
15 years 11 months ago
Load and Network Aware Query Routing for Information Integration
Current federated systems deploy cost-based query optimization mechanisms; i.e., the optimizer selects a global query plan with the lowest cost to execute. Thus, cost functions in...
Wen-Syan Li, Vishal S. Batra, Vijayshankar Raman, ...
ATAL
2005
Springer
15 years 11 months ago
A polynomial algorithm for decentralized Markov decision processes with temporal constraints
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
Aurélie Beynier, Abdel-Illah Mouaddib
136
Voted
SRDS
2003
IEEE
15 years 11 months ago
Assessing the Dependability of OGSA Middleware by Fault Injection
This paper presents our research on devising a dependability assessment method for the upcoming OGSA 3.0 middleware using network level fault injection. We compare existing DCE mi...
Nik Looker, Jie Xu
AGENTS
2000
Springer
15 years 10 months ago
Tools for Developing and Monitoring Agents in Distributed Multi-Agent Systems
Before the powerful agent programming paradigm can be adopted in commercial or industrial settings, a complete environment, similar to that for other programming languages, must b...
John R. Graham, Daniel McHugh, Michael Mersic, Fos...