Title of dissertation: HILL-CLIMBING SMT PROCESSOR RESOURCE DISTRIBUTION Seungryul Choi, Doctor of Philosophy, 2006 Dissertation directed by: Professor Donald Yeung Department of Electrical and Computer Engineering The key to high performance in SMT processors lies in optimizing the shared resources distribution among simultaneously executing threads. Existing resource distribution techniques o...

Learning the structure of a Bayesian Network (BN) with score-based solutions involves exploring search space possible graphs and moving towards graph that maximises given objective function. Some algorithms offer exact guarantee to return highest score, while others approximate in exchange for reduced computational complexity. This paper describes an BN learning algorithm, which we call Model A...

We present an information-theoretic analysis of Darwin’s theory of evolution, modeled as a hill-climbing algorithm on a fitness landscape. Our space of possible organisms consists of computer programs, which are subjected to random mutations. We study the random walk of increasing fitness made by a single mutating organism. In two different models we are able to show that evolution will occur a...

In this paper, the introduction of a homeostatic regulation mechanism in a vision system is proposed. This homeostatic mechanism takes charge of controlling the luminance, white balance, contrast and size of the object of interest in the image, using naive methods except for the contrast, for which we have implemented a method that avoids the hill climbing search for the best focus position. We...

We consider the algorithmic problem of selecting a set of target nodes that cause the biggest activation cascade in a network. In case when the activation process obeys the diminishing return property, a simple hill-climbing selection mechanism has been shown to achieve a provably good performance. Here we study models of influence propagation that exhibit critical behavior and where the proper...

This paper presents the software design for a team of soccer playing robots developed at the Univ. of Pennsylvania for the 2004 Robocup competition. The software was a port and slight modification from the 2003 competition code. Lower level sensory and motor functions were first prototyped in Matlab. High level behaviors and team coordination were implemented using an embedded Perl interpreter....

This paper introduces the Extremum Consistency (EC) algorithm for avoiding local maxima and minima in a specialised domain. The most notable difference between this approach and others in the literature is that it places a greater importance on the width or consistency of an extremum than on its height or depth (amplitude). Short-term, high amplitude extrema can be encountered in many typical s...

We present an information-theoretic analysis of Darwin’s theory of evolution, modeled as a hill-climbing algorithm on a fitness landscape. Our space of possible organisms consists of computer programs, which are subjected to random mutations. We study the random walk of increasing fitness made by a single mutating organism. In two different models we are able to show that evolution will occur a...

In this paper we describe an optimal reconfiguration planning algorithm that morphs a grounded truss structure of known geometry into a new geometry. The plan consists of a sequence of paths to move truss elements to their new locations that generate the new truss geometry. The trusses are grounded and remain connected at all time. Intuitively, the algorithm grows gradually the new truss struct...

We discuss an approach to creating new terms during the induction of Horn clauses. The new terms enable a selective form of look-ahead during hill-climbing search. This look-ahead is needed because a conjunction of literals may be useful while each literal individually may not appear to be useful. We exploit knowledge of common patterns of conjunctions to avoid the necessity of testing all pair...