566 search results - page 56 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
112
Voted
CSCLP
2004
Springer
15 years 5 months ago
2004
Springer
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
97
Voted
FM
2005
Springer
15 years 6 months ago
2005
Springer
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...
106
click to vote
AI
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
105
Voted
ICCAD
1994
IEEE
15 years 4 months ago
1994
IEEE
1 This paper provides a new, generalized approach to the problem of encoding information as vectors of binary digits. We furnish a formal definition for the Boolean constrained enc...
109
click to vote
IJCNN
2006
IEEE
15 years 6 months ago
2006
IEEE
— Job-shop scheduling is one of the most difficult production scheduling problems in industry. This paper proposes an adaptive neural network and local search hybrid approach fo...