198 search results - page 35 / 40 » Colouring, constraint satisfaction, and complexity |
101
click to vote
EDOC
2007
IEEE
15 years 1 months ago
2007
IEEE
The decentralized process of configuring enterprise applications is complex and error-prone, involving multiple participants/roles and numerous configuration changes across multipl...
AAAI
2004
14 years 11 months ago
2004
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
118
click to vote
CPAIOR
2010
Springer
14 years 7 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
91
Voted
LATIN
2010
Springer
14 years 7 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
COMPSAC
2008
IEEE
15 years 3 months ago
2008
IEEE
We discuss the suitability of service-oriented computing for the automotive domain. We present a formal high-level language in which complex automotive activities can be modelled ...