7092 search results - page 361 / 1419 » Parallelizing constraint programs |
113
click to vote
IDEAS
2005
IEEE
15 years 8 months ago
2005
IEEE
We introduce and study a new class of queries that we refer to as ACMA (arithmetic constraints on multiple attributes) queries. Such combinatorial queries require the simultaneous...
118
click to vote
CP
2004
Springer
15 years 8 months ago
2004
Springer
This paper presents a model and implementation techniques for speeding up constraint propagation. Two fundamental approaches to improving constraint propagation are explored: keepi...
123
click to vote
ICLP
1999
Springer
15 years 7 months ago
1999
Springer
Fair allocation of payoffs among cooperating players who can form various coalitions of differing utilities is the classic game theoretic “coalition problem.” Shapley’s va...
130
click to vote
ECAI
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
154
click to vote
ACL
1997
15 years 4 months ago
1997
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...