706 search results - page 46 / 142 » Super Solutions in Constraint Programming |
117
click to vote
ECAI
2010
Springer
15 years 27 days ago
2010
Springer
Symmetry is an important feature of many constraint programs. We show that any symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different s...
LATA
2010
Springer
15 years 9 months ago
2010
Springer
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
OOPSLA
1991
Springer
15 years 3 months ago
1991
Springer
We present a new approach to inferring types in untyped object-oriented programs with inheritance, assignments, and late binding. It guarantees that all messages are understood, a...
CP
2007
Springer
15 years 6 months ago
2007
Springer
We introduce a definition of constraint symmetry for soft CSPs, based on the definition of constraint symmetry for classical CSPs. We show that the constraint symmetry group of a...
ICLP
1999
Springer
15 years 4 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...