1378 search results - page 47 / 276 » The Tractability of Global Constraints |
113
click to vote
CP
2004
Springer
15 years 7 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...
127
click to vote
POPL
1990
ACM
15 years 5 months ago
1990
ACM
Abstract. Concurrent constraint programming is a simple but powerful framework for computation based on four basic computational ideas: concurrency (multiple agents are simultaneou...
107
click to vote
NIPS
2007
15 years 3 months ago
2007
The expectation maximization (EM) algorithm is a widely used maximum likelihood estimation procedure for statistical models when the values of some of the variables in the model a...
114
click to vote
IS
2008
15 years 1 months ago
2008
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
119
click to vote
ASPDAC
2006
ACM
15 years 8 months ago
2006
ACM
− In this paper, we present a new timing-driven placement algorithm, which attempts to minimize zigzags and crisscrosses on the timing-critical paths of a circuit. We observed th...