Sciweavers

195 search results - page 7 / 39
» Distributed abductive reasoning with constraints
Sort
View
AAAI
2006
14 years 11 months ago
A New Approach to Distributed Task Assignment using Lagrangian Decomposition and Distributed Constraint Satisfaction
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
Katsutoshi Hirayama
169
Voted
POPL
2009
ACM
15 years 10 months ago
Compositional shape analysis by means of bi-abduction
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
Cristiano Calcagno, Dino Distefano, Peter W. O'Hea...
ATAL
2008
Springer
14 years 11 months ago
Resource constrained distributed constraint optimization using resource constraint free pseudo-tree
The Distributed Constraint Optimization Problem (DCOP) is a fundamental formalism for multi-agent cooperation. A dedicated framework called Resource Constrained DCOP (RCDCOP) has ...
Toshihiro Matsui, Marius Silaghi, Katsutoshi Hiray...
BVAI
2007
Springer
14 years 11 months ago
Logic as Energy: A SAT-Based Approach
This paper presents the implementation of ARQ-PROP II, a limited-depth propositional reasoner, via the compilation of its specification into an exact formulation using the satyrus...
Priscila Machado Vieira Lima, M. Mariela Morveli-E...
COORDINATION
2006
Springer
15 years 1 months ago
Stochastic Reasoning About Channel-Based Component Connectors
Abstract. Constraint automata have been used as an operational model for component connectors that coordinate the cooperation and communication of the components by means of a netw...
Christel Baier, Verena Wolf