566 search results - page 42 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
105
Voted
CP
2000
Springer
15 years 4 months ago
2000
Springer
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...
GLOBECOM
2008
IEEE
15 years 7 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 ...
100
Voted
GLOBECOM
2008
IEEE
15 years 7 months ago
2008
IEEE
—Most research works in routing and design of optical networks assume that the optical medium can carry signals without any bit error. However, the physical impairments on the op...
139
click to vote
CP
1998
Springer
15 years 4 months ago
1998
Springer
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
104
click to vote
ECAI
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...