5090 search results - page 337 / 1018 » Constructing Strategies for Programming |
151
click to vote
LOPSTR
2009
Springer
15 years 9 months ago
2009
Springer
In this paper, we propose an approach for automated test case generation based on techniques from constraint programming (CP). We advocate the use of standard CP search strategies ...
132
click to vote
CCCG
1996
15 years 6 months ago
1996
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...
128
click to vote
TCS
2008
15 years 5 months ago
2008
This paper presents strategies for improving the known upper and lower bounds for the bandwidth of Hamming graphs (Kn)d and [0, 1]d. Our labeling strategy lowers the upper bound o...
139
click to vote
ENTCS
2002
15 years 4 months ago
2002
This article discusses mutation testing strategies in the context of refinement. Here, a novel generalization of mutation testing techniques is presented to be applied to contract...
162
click to vote
ECCV
2000
Springer
16 years 7 months ago
2000
Springer
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties ...