592 search results - page 33 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
130
Voted
CHARME
2003
Springer
15 years 7 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
101
Voted
MICCAI
2004
Springer
16 years 3 months ago
2004
Springer
In this paper we discuss image registration techniques with a focus on volume preserving constraints. These constraints can reduce the non-uniqueness of the registration problem si...
97
Voted
CP
2006
Springer
15 years 6 months ago
2006
Springer
This paper presents an enumerative approach for a sports league scheduling problem. This simple method can solve some instances involving a number T of teams up to 70 while the bes...
103
Voted
CP
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
121
Voted
COLT
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We present a unified and complete account of maximum entropy distribution estimation subject to constraints represented by convex potential functions or, alternatively, b...