1151 search results - page 13 / 231 » Modelling Digital Circuits Problems with Set Constraints |
CP
2004
Springer
14 years 1 months ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
MOBIHOC
2007
ACM
14 years 7 months ago
2007
ACM
Recently, there has been substantial interest in the design of crosslayer protocols for wireless networks. These protocols optimize certain performance metric(s) of interest (e.g....
CEEMAS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Distributed Constraint Satisfaction Problems (DCSP) is a general framework for multi-agent coordination and conflict resolution. In most DCSP algorithms, inter-agent com...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
AAAI
2000
13 years 9 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...