601 search results - page 70 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
ICRA
2007
IEEE
15 years 7 months ago
2007
IEEE
— The rapidly increasing complexity of tasks robotic systems are expected to carry out underscores the need for the development of motion planners that can take into account disc...
107
click to vote
TAP
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Usage of combinatorial testing is wide spreading as an effective technique to reveal unintended feature interaction inside a given system. To this aim, test cases are con...
137
click to vote
STACS
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
138
click to vote
CP
2008
Springer
15 years 3 months ago
2008
Springer
Modern computer architectures have complex features that can only be fully taken advantage of if the compiler schedules the compiled code. A standard region of code for scheduling ...
129
click to vote
JAIR
2011
14 years 8 months ago
2011
In this paper, we propose a comprehensive study of second-order consistencies (i.e., consistencies identifying inconsistent pairs of values) for constraint satisfaction. We build ...