Sciweavers

2767 search results - page 332 / 554
» Universal Exponentiation Algorithm
Sort
View
123
Voted
AIPS
2008
15 years 4 months ago
From One to Many: Planning for Loosely Coupled Multi-Agent Systems
Loosely coupled multi-agent systems are perceived as easier to plan for because they require less coordination between agent sub-plans. In this paper we set out to formalize this ...
Ronen I. Brafman, Carmel Domshlak
122
Voted
APPROX
2008
Springer
190views Algorithms» more  APPROX 2008»
15 years 4 months ago
The Complexity of Local List Decoding
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
Dan Gutfreund, Guy N. Rothblum
135
Voted
BIRTHDAY
2008
Springer
15 years 4 months ago
AND/OR Multi-valued Decision Diagrams for Constraint Networks
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...
Robert Mateescu, Rina Dechter
146
Voted
CCGRID
2008
IEEE
15 years 4 months ago
Scheduling of Scientific Workflows on Data Grids
Selection of resources for execution of scientific workflows in data grids becomes challenging with the exponential growth of files as a result of the distribution of scientific e...
Suraj Pandey, Rajkumar Buyya
EWRL
2008
15 years 4 months ago
Optimistic Planning of Deterministic Systems
If one possesses a model of a controlled deterministic system, then from any state, one may consider the set of all possible reachable states starting from that state and using any...
Jean-François Hren, Rémi Munos