277 search results - page 31 / 56 » Conditional Lexicographic Orders in Constraint Satisfaction ... |
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—In this contribution, we propose an original algorithm for self-localization in mobile ad-hoc networks. The proposed technique, based on interval analysis, is suited to ...
QSIC
2005
IEEE
14 years 1 months ago
2005
IEEE
Fault-based testing is a technique where testers anticipate errors in a system under test in order to assess or generate test cases. The idea is to have enough test cases capable ...
JAIR
2011
13 years 2 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 ...
IGPL
2006
13 years 7 months ago
2006
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...