Sciweavers

1844 search results - page 43 / 369
» Exploiting the Structure of Distributed Constraint Optimizat...
Sort
View
ICML
2006
IEEE
16 years 8 hour ago
Learning the structure of Factored Markov Decision Processes in reinforcement learning problems
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...
Thomas Degris, Olivier Sigaud, Pierre-Henri Wuille...
ADBIS
2006
Springer
165views Database» more  ADBIS 2006»
15 years 3 months ago
Fragmenting XML Documents via Structural Constraints
Abstract. XML query processors suffer from main-memory limitations that prevent them from processing large XML documents. While content-based predicates can be used to project down...
Angela Bonifati, Alfredo Cuzzocrea, Bruno Zinno
ATAL
2008
Springer
15 years 1 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan
ATAL
2008
Springer
15 years 1 months ago
Coordination of first responders under communication and resource constraints
This paper discusses the application of distributed constraint optimization to coordination in disaster management situations under sub-optimal network conditions. It presents an ...
Robert N. Lass, Joseph B. Kopena, Evan Sultanik, D...
DCOSS
2005
Springer
15 years 4 months ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das