1378 search results - page 96 / 276 » The Tractability of Global Constraints |
170
click to vote
AAAI
2006
15 years 7 months ago
2006
Several methods for breaking value symmetries have been proposed recently in the constraint programming community. They can be used in conjunction with variable symmetry breaking ...
161
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
142
click to vote
FSTTCS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. In [12] we started a research on a distributed-timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the ...
158
click to vote
TCAD
2008
15 years 6 months ago
2008
Abstract--Recent analytical global placers use density constraints to approximate nonoverlap constraints, and these show very successful results. This paper unifies a wide range of...
171
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
Several research efforts as well as deployments have chosen IEEE 802.11 as a low-cost, long-distance access technology to bridge the digital divide. In this paper, we consider the...