2834 search results - page 300 / 567 » Representing Trees with Constraints |
180
click to vote
TACAS
2009
Springer
16 years 1 months ago
2009
Springer
Software testing is an essential process to improve software quality in practice. Researchers have proposed several techniques to automate parts of this process. In particular, sym...
179
click to vote
ICDCSW
2009
IEEE
16 years 1 months ago
2009
IEEE
Designing cyber-physical systems with high efficiency, adaptability, autonomy, reliability and usability is a challenging task. In this paper, we focus on minimizing networkwide ...
173
click to vote
CP
2007
Springer
16 years 23 days ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
149
click to vote
SAC
2005
ACM
16 years 5 days ago
2005
ACM
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
175
click to vote
CP
2005
Springer
16 years 4 days ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...