Within the turreted ramparts of London’s ancient Tower, long the most famous political prison in the English-speaking world, modern tourists can view hundreds of inscriptions hand scratched on the walls of chambers that were once the habitations of those unfortunate enough to incur the wrath of the Crown. Some are mournful, some are sycophantic, some are bitter, some are philosophical, and some...

The Iterative Multi-Agent (IMA) Method works by breaking down a search problem into many sub-problems, each to be solved separately. Independent problem solving agents work on the sub-problems and use iteration to handle any interaction between the sub-problems. Each agent knows about a subset of the whole problem and cannot solve it all by itself. The agents, working in parallel, can use any m...

First, we will assume without loss of generality that the points are contained within a minimum bounding box with side length n2. Second, we will assume all points have integer coordinates. It can be shown that this modification can add no more than 2 √ 2n to the total length of an optimal tour in the transformed instance (see previous lecture). Also, note that this rounding may ’collapse’ seve...

Three 'killer genes' in one species of fission yeast act selfishly and keep it reproductively isolated from a closely related species.

In this paper a rule learning algorithm for the prediction of numerical target variables is presented. It is based on the separate-and-conquer strategy and the classification phase is done by a decision list. A new splitpoint generation method is introduced for the efficient handling of numerical attributes. It is shown that the algorithm performs comparable to other regression algorithms where...

Paul Koch’s “Stop and Chop” method is a hybrid of divide-and-conquer and horizontal chopping. His technique begins with sculpting a traditional deep, central groove in order to crack the nucleus in half. One then stops the divide-and-conquer method, and chops the hemi-nuclei. Although the Koch method utilizes some horizontal chopping, this author coined the term “Non-stop Chop” to differentiate...

In this randomized prospective study, the cumulative dissipated energy and case time of pop and chop and of traditional four-quadrant divide and conquer in the first 60 cases (in total 120 eyes) of cataract surgery performed by two residents at the Veterans Administration Hospital in Hampton, Virginia, were compared. Overall and individually, the residents had significantly shorter case times a...

Classification is an important problem in the field of data mining. Construction of good classifiers is computationally intensive and offers plenty of scope for parallelization. Divide-and-conquer paradigm can be used to efficiently construct decision tree classifiers. We discuss in detail various techniques for parallel divide-and-conquer and extend these techniques to handle efficiently disk-...

Satisfiability solvers targeting industrial instances are currently almost always based on conflict-driven clause learning (CDCL) [5]. This technique can successfully solve very large instances. Yet on small, hard problems lookahead solvers [3] often perform better by applying much more reasoning in each search node and then recursively splitting the search space until a solution is found. The ...

Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show that memory requirements can be reduced even further by using a breadth-first instead of a best-first search strategy. We describe optimal and approximate breadth-first heuristic search algorithms that use divide-and-c...