Sciweavers

1403 search results - page 32 / 281
» On Communication in Solving Distributed Constraint Satisfact...
Sort
View
94
Voted
AMAI
2004
Springer
15 years 3 months ago
New Look-Ahead Schemes for Constraint Satisfaction
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
Kalev Kask, Rina Dechter, Vibhav Gogate
AI
2003
Springer
15 years 2 months ago
A Graph Based Backtracking Algorithm for Solving General CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
Wanlin Pang, Scott D. Goodwin
CP
2009
Springer
15 years 10 months ago
From Model-Checking to Temporal Logic Constraint Solving
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
Aurélien Rizk, François Fages
CP
2001
Springer
15 years 2 months ago
Partially Ordered Constraint Optimization Problems
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...
Marco Gavanelli
SCP
2011
228views Communications» more  SCP 2011»
14 years 4 months ago
Channel-based coordination via constraint satisfaction
Coordination in Reo emerges from the composition of the behavioural constraints of primitives, such as channels, in a component connector. Understanding and implementing Reo, howe...
Dave Clarke, José Proença, Alexander...