6456 search results - page 124 / 1292 » Constraint Solving on Terms |
178
click to vote
INFOCOM
2011
IEEE
14 years 9 months ago
2011
IEEE
—Heterogeneous wireless networks employ varying degrees of network coverage using power control in a multi-tier configuration, where low-power femtocells are used to enhance per...
163
click to vote
AICOM
2004
15 years 6 months ago
2004
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
139
click to vote
ISSTA
2006
ACM
16 years 7 days ago
2006
ACM
Test campaigns usually require only a restricted subset of paths in a program to be thoroughly tested. As random testing (RT) offers interesting fault-detection capacities at low ...
162
click to vote
SARA
2007
Springer
16 years 12 days ago
2007
Springer
Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...
156
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...