This paper proposes two behavioral patterns called DIVIDE-&-CONQUER and BACKTRACKING to facilitate the development of algorithms based upon algorithm design techniques. The common informal seudocode that specifies the solving strategy for a general algorithm design technique is enhanced to provide a helpful guide to develop particular algorithms by following the divide and conquer and the backt...

Multi-Point Constructive Search maintains a small set of “elite solutions” that are used to heuristically guide constructive search through periodically restarting search from an elite solution. Empirical results indicate that for job shop scheduling optimization problems and quasi-group completion problems, multi-point constructive search performs significantly better than chronological backtr...

Failing integration builds are show stoppers. Development activity is stalled because developers have to wait with integrating new changes until the problem is fixed and a successful build has been run. We show how backtracking can be used to mitigate the impact of build failures in the context of component-based software development. This way, even in the face of failure, development may conti...

There has been substantial recent interest in two new families of search techniques. One family consists of nonsystematic methods such as GSAT; the other contoi-~ systematic approaches that use a polynomial amount of justification information to prune the search space. This paper introduces a new technique that combines these two approaches. The algorithm allows substantial freedom of movement ...