Now showing items 1-20 of 444

• #### A computational method for constructing Sylvester-style sparse resultants ﻿

(2005)
We present a computational approach for constructing Sylvester style resultants for sparse systems of bivariate polynomial equations. Necessary and sufficient conditions are derived which guarantee that a multiplying set ...
• #### A Computational Model of Jetliner Taxiing ﻿

(2012)
The Next Generation Air Transportation System (NextGen) is transforming the way planes move on the ground as well as in the sky. Some of the proposed changes, such as automated scheduling algorithms to generate taxi ...
• #### A computational study of vehicle routing applications ﻿

(1999)
This thesis examines three specific routing applications. In the first model, the scheduling of home health care providers from their homes, to a set of patients, and then back to their respective homes, is performed both ...

(1964)
• #### A connectionist approach to autonomous robotic navigation ﻿

(1991)
Robotic navigation has been an area of intense research since the onset of mobile robot development. The usefulness of mobile robots ultimately reside in their ability to move and interact with the environment. Current ...
• #### A consistent and transparent solution for caching dynamic Web content ﻿

(2005)
Caching is an effective means for reducing load on web servers, especially for those that dynamically generate documents in dynamic web applications. While adding caching to a web application can greatly reduce response ...
• #### A correspondence between Scheme and the lambda(,upsilon)-CS-calculus ﻿

(1989)
We study the relationship between the programming language Scheme and the $\lambda\sb{v}$-CS-calculus. To this end, we define a correspondence between Scheme and $\Lambda\sb{CS}$-terms--the language of the calculus--where ...
• #### A dynamic distributed transmission power control MAC protocol for mobile ad hoc networks ﻿

(2003)
Ad hoc networking involves multihop, peer-to-peer communication between a group of wireless mobile nodes in a network with a dynamically changing topology. Achieving energy-efficient communication in such a network is more ...
• #### A dynamic model of comprehension with applications to Korean and English ﻿

(1988)
Most researchers working to develop a comprehension process fail to distinguish the different levels often recognized by linguists. Some, for example, have attempted to incorporate a composite form such as 'has' into one ...
• #### A factored, interpolatory subdivision scheme for surfaces of revolution ﻿

(2003)
We present a new non-stationary, interpolatory subdivision scheme capable of producing circles and surfaces of revolution and in the limit is C1. First, we factor the classical four point interpolatory scheme of Dyn et ...
• #### A FEATURE CONSTRUCTION METHODOLOGY FOR RECOGNITION OF COMPLEX PATTERNS IN SCENES ﻿

(1981)
A framework and techniques for recognition and analysis of complex patterns in scenes are presented. By a "complex pattern" we mean a configuration of objects of interest, called "simple patterns", which appear in full ...
• #### A first-class approach to genericity ﻿

(2003)
This thesis describes how to add first-class generic types---including mixins---to strongly-typed object-oriented languages with nominal subtyping such as Java and C#. A generic type system is "first-class" if generic types ...
• #### A framework for building pedagogic Java programming environments ﻿

(2002)
Java has become the dominant language for teaching introductory computer science at both the high school and college levels. Yet Java's development tools and syntax often distract beginning students from the programming ...
• #### A framework for managing models in nonlinear optimization of computationally expensive functions ﻿

(1999)
One of the most significant problems in the application of standard optimization methods to real-world engineering design problems is that the computation of the objective function often takes so much computer time (sometimes ...
• #### A Framework for Testing Concurrent Programs ﻿

(2011)
This study proposes a new framework that can effectively apply unit testing to concurrent programs, which are difficult to develop and debug. Test-driven development, a practice enabling developers to detect bugs early by ...
• #### A GLOBAL APPROACH TO DETECTION OF PARALLELISM (COMPILERS) ﻿

(1987)
Modern computers will increasingly rely on parallelism to achieve high computation rates. Techniques to automatically detect and exploit parallelism have been shown effective for computers with vector capabilities. To ...

(1977)

(1976)
• #### A historical development of the (n+1)-point secant method ﻿

(2007)
Many finite-dimensional minimization problems and nonlinear equations can be solved using Secant Methods. In this thesis, we present a historical development of the (n + 1)-point Secant Method tracing its evolution back ...
• #### A large-scale trust-region approach to the regularization of discrete ill-posed problems ﻿

(1999)
We consider the problem of computing the solution of large-scale discrete ill-posed problems when there is noise in the data. These problems arise in important areas such as seismic inversion, medical imaging and signal ...