Sciweavers

287 search results - page 17 / 58
» An Algebraic Approach to Constraint Satisfaction Problems
Sort
View
CP
1995
Springer
15 years 1 months ago
Optimization-based Heuristics for Maximal Constraint Satisfaction
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
Javier Larrosa, Pedro Meseguer
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...
AGENTS
2001
Springer
15 years 2 months ago
Argumentation as distributed constraint satisfaction: applications and results
Conflict resolution is a critical problem in distributed and collaborative multi-agent systems. Negotiation via argumentation (NVA), where agents provide explicit arguments or ju...
Hyuckchul Jung, Milind Tambe, Shriniwas Kulkarni
CSR
2006
Springer
15 years 1 months ago
The Complexity of Equality Constraint Languages
We classify the computational complexity of all constraint satisfaction problems where the constraint language is preserved by all permutations of the domain. A constraint languag...
Manuel Bodirsky, Jan Kára
ICCV
1998
IEEE
15 years 11 months ago
Minimizing Algebraic Error in Geometric Estimation Problems
This paper gives a widely applicable technique for solving many of the parameter estimation problems encountered in geometric computer vision. A commonly used approach is to minim...
Richard I. Hartley