We present a new hybrid constraint solving schema which retains some systematicity of constructive search while incorporating the heuristic guidance and lack of commitment to variable assignment of local search. Our method backtracks through a space of complete but possibly inconsistent solutions while supporting the freedom to move arbitrarily under heuristic guidance. The version of the schem...

This paper investigates a dynamic path-based method for constructing conjunctions as new attributes for decision tree learning. It searches for conditions (attribute-value pairs) from paths to form new attributes. Compared with other hypothesis-driven new attribute construction methods, the new idea of this method is that it carries out systematic search with pruning over each path of a tree to...

The Problem: The goal of this project is to systematically enumerate feasible conformations (three-dimensional configurations) of a flexible molecule, subject to a given set of constraints on the distances between atoms and on the torsional angles of rotatable bonds. Without any constraints, the conformation space of a flexible molecule is astronomical (exponential in the number of degrees of f...

In our previous work we showed that systematic search approach to inductive functional programming automation makes a remarkably efficient algorithm, but the applicability of the implemented program was limited by the very poor interpreter incorporated. In this paper, we present a library-based implementation of our systematic search algorithm which is supposed to be used with a well-known Hask...

Constraint satisfaction problem (CSP) paradigm has proven highly successful in product configuration, particularly for build-to-order products, by assigning component types to all components without violating any constraints. For engineer-to-order products, however, product configuration requires assigning design parameters to each component as well. Hence, it often involves numeric variables, ...

It is becoming increasingly important to understand in greater detail how people process information and make decisions while searching on the World Wide Web. With the distinction between systematic and heuristic processing, dual-process theories and decision theory provide a useful framework for analyzing this decision-making. A laboratory quasi-experiment was conducted, combining a client-ori...

In this paper, we present a dynamic and adaptive variable ordering heuristic which guides systematic search toward inconsistent or hard parts of a Constraint Satisfaction Problem (CSP). This generic heuristic is able to exploit information about previous states of the search process whereas traditional dynamic ones only exploit information about the current state. Intuitively, it avoids some tr...

A systematic search approach to the automatic refinement of protein structures could reduce the need for manual intervention. In this approach, possible conformations for a segment of the polypeptide chain are generated systematically and the trial segments are scored for their agreement with the observed diffraction data. The sampling of conformational space is sufficiently exhaustive that rea...

Learning Goals ¯ Understand motivation and concepts of randomised systematic search (RSS) and stochastic tree search (STS). ¯ Understand randomisation and restart mechanisms for RSS. ¯ Know about characteristic RSS behaviour, in particular " heavy-tailed " run-time and search cost distributions.