Sciweavers

980 search results - page 66 / 196
» Decentralized Constraint Satisfaction
Sort
View
CORR
2010
Springer
136views Education» more  CORR 2010»
14 years 7 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
CP
2005
Springer
15 years 4 months ago
Encoding HTN Planning as a Dynamic CSP
Abstract. Constraint satisfaction problems provide strong formalism for modeling variety of real life problems. This paper presents a work currently in progress of which the goal i...
Pavel Surynek, Roman Barták
CP
2006
Springer
15 years 2 months ago
Propagation in CSP and SAT
Abstract. Constraint Satisfaction Problems and Propositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importan...
Yannis Dimopoulos, Kostas Stergiou
ICSOC
2005
Springer
15 years 3 months ago
Handling Faults in Decentralized Orchestration of Composite Web Services
Abstract. Composite web services can be orchestrated in a decentralized manner by breaking down the original service specification into a set of partitions and executing them on a...
Girish Chafle, Sunil Chandra, Pankaj Kankar, Vijay...
ATAL
2006
Springer
15 years 2 months ago
Examining DCSP coordination tradeoffs
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
Michael Benisch, Norman M. Sadeh