 IDEALS Home
 →
 Browse by Subject
Browse by Subject "Computer Science"
Now showing items 462481 of 1257

(1995)The primary contribution of this dissertation is the presentation of a dynamic gametheoretic framework that is used as an analytical tool and unifying perspective for a wide class of problems in robot motion planning. The ...
application/pdf
PDF (11MB) 
(2003)We next apply the above findings towards improving the energy efficiency of generalpurpose processors for realtime multimedia applications. Recently, researchers have proposed two forms of hardware adaptation to improve ...
application/pdf
PDF (7MB) 
(1988)Explanationbased learning (EBL) is a learning method which uses existing knowledge of the domain to construct an explanation for why a specific example is a member of a concept or why a specific combination of actions ...
application/pdf
PDF (11MB) 
application/pdf
PDF (3MB) 
(1992)The research contribution of this dissertation is a formal, computational model of the semantics of negation in natural language; its major components are two knowledge representation formalisms with Boolean semantics: a ...
application/pdf
PDF (10MB) 
(1989)We study the numerical solution of Hessenberg form differential algebraic equations by variable stepsize generalized backward difference formulae (GBDF). GBDF methods of sufficiently high order are shown to converge for ...
application/pdf
PDF (3MB) 
(1988)Explanationbased learning is a recently developed approach to concept acquisition by computer. In this type of machine learning, a specific problem's solution is generalized into a form that can later be used to solve ...
application/pdf
PDF (11MB) 
application/pdf
PDF (9MB) 
(2009)High performance, massivelyparallel multiphysics simulations are built on efficient mesh data structures. Most data structures are designed from the bottom up, focusing on the implementation of linear algebra routines. ...
application/pdf
PDF (3MB) 
(1997)This thesis also serves as an illustration of some of the useful learning paradigms that are discovered by research in computational learning theory.
application/pdf
PDF (8MB) 
(1989)This thesis proposes a decompositionbased algorithmic paradigm, called planning with local experts, where the given global planning problem is decomposed into a set of subproblems that are each solved efficiently in a ...
application/pdf
PDF (6MB) 
(1988)We consider problems in geometric probing, the algorithmic study of determining a geometric structure or some aspect of that structure from the results of a mathematical or physical measuring device. A variety of problems ...
application/pdf
PDF (6MB) 
(1996)Macromolecules such as proteins and DNA have complex spatial structures which are often important for their biological functions. The idea of molecular shape and shape complementarity play crucial roles in protein folding, ...
application/pdf
PDF (4MB) 
(1997)We show experimental results in applying Novel to solve nonlinear optimisation problems, including (a) the learning of feedforward neural networks, (b) the design of quadraturemirrorfilter digital filter banks, (c) the ...
application/pdf
PDF (13MB) 
(2006)The proposed approach in this thesis has advantages over existing approaches to analyzing complex spatiotemporal data. Experiments show that the new modeling features of our approach improve the performance of existing ...
application/pdf
PDF (3MB) 
(1994)This research explores the representational and computational complexities of qualitative reasoning about timevarying behavior. Traditional techniques employ qualitative simulation (QS) to compute envisionments (i.e. ...
application/pdf
PDF (7MB) 
(2004)We have implemented GRACEOS in the Linux kernel and evaluated it with adaptive Athlon processor and adaptive video codec applications. Our experimental results show that GRACEOS efficiently trades off QoS for energy with ...
application/pdf
PDF (8MB) 
(2000)The dissertation proposes an explicit and general analysis of case, which is extendable to the analyses of the syntax and semantics of the topic morpheme, and the "topiclike" nominative morpheme in Japanese. A case phrase, ...
application/pdf
PDF (6MB) 
(1990)We propose the use of graph grammars as a theory to organize programming of highlyconcurrent systems. To understand the interactions among components of a concurrent system it is useful to visualize the system as dynamically ...
application/pdf
PDF (12MB) 
(1988)Given an ordering of the vertices of a graph around a circle, a page is a collection of edges forming noncrossing chords. A book embedding is a circular permutation of the vertices together with a partition of the edges ...
application/pdf
PDF (3MB)
Now showing items 462481 of 1257