Sciweavers

721 search results - page 40 / 145
» GRASP - evolution for constraint satisfaction problems
Sort
View
AI
2005
Springer
14 years 9 months ago
Asynchronous aggregation and consistency in distributed constraint satisfaction
Constraint Satisfaction Problems (CSP) have been very successful in problem-solving tasks ranging from resource allocation and scheduling to configuration and design. Increasingly...
Marius-Calin Silaghi, Boi Faltings
CSE
2009
IEEE
15 years 4 months ago
Privacy-Preserving Multi-agent Constraint Satisfaction
—Constraint satisfaction has been a very successful paradigm for solving problems such as resource allocation and planning. Many of these problems pose themselves in a context in...
Thomas Léauté, Boi Faltings
CAEPIA
2003
Springer
15 years 2 months ago
Distributed Non-binary Constraints
Nowadays many real problems can be modeled as Constraint Satisfaction Problems (CSPs). In many situations, it is desirable to be able to state both hard constraints and soft constr...
Miguel A. Salido, Federico Barber
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...
CSCLP
2004
Springer
15 years 3 months ago
A System Prototype for Solving Multi-granularity Temporal CSP
Abstract. Time granularity constraint reasoning is likely to have a relevant role in emerging applications like GIS, time management in the Web and Personal Information Management ...
Claudio Bettini, Sergio Mascetti, Vincenzo Pupillo