1516 search results - page 28 / 304 » The Increasing Nvalue Constraint |
110
Voted
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we present a dynamic and adaptive variable ordering heuristic which guides systematic search toward inconsistent or hard parts of a Constraint Satisfaction Problem (...
ENTCS
2008
14 years 9 months ago
2008
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...
VLSID
2003
IEEE
15 years 10 months ago
2003
IEEE
In the previous work, the problem of nding gate delays to eliminate glitches has been solved by linear programs (LP) requiring an exponentially large number ofconstraints. By intr...
MUM
2009
ACM
15 years 4 months ago
2009
ACM
There are academic and commercial drivers for contextawareness to play a prominent role in the future of mobile services. Implementing a complete model of context remains an unsol...
MDM
2007
Springer
15 years 3 months ago
2007
Springer
— In mobile ad-hoc peer-to-peer (M-P2P) networks, economic models become a necessity for enticing non-cooperative mobile peers to provide service. M-P2P users may issue queries w...