Now showing items 1-10 of 283
Measuring facets of polyhedra to predict usefulness in branch-and-cut algorithms
(Georgia Institute of Technology, 2003-12-01)
Software Tools for Separating Distribution Concerns
(Georgia Institute of Technology, 2005-11-18)
With the advent of the Internet, distributed programming has become a necessity for the majority of application domains. Nevertheless, programming distributed systems remains a delicate and complex task. This dissertation ...
New recursive algorithms for training feedforward multilayer perceptrons
(Georgia Institute of Technology, 1999-08)
A new finite difference solution to the Fokker-Planck equation with applications to phase-locked loops
(Georgia Institute of Technology, 1973-12)
Approximation algorithms for finding planar and highly connected subgraphs
(Georgia Institute of Technology, 1997)
Transient versioning for concurrency and recovery
(Georgia Institute of Technology, 1996)
Iterative space-time domain fast multiresolution SAR imaging algorithms
(Georgia Institute of Technology, 2001-12)
Internet Based Bilateral Teleoperation
(Georgia Institute of Technology, 2006-10-17)
In conventional bilateral teleoperation, transmission delay over the Internet can potentially cause instability. The wave variable algorithm guarantees stability under varying transmission delay at the cost of poor transient ...
Demand-Driven Type Inference with Subgoal Pruning
(Georgia Institute of Technology, 2005-08-29)
Highly dynamic languages like Smalltalk do not have much static type information immediately available before the program runs. Static types can still be inferred by analysis tools, but historically, such analysis is ...
Procedural Reduction Maps
(Georgia Institute of Technology, 2007-01-16)
Procedural textures and image textures are commonplace in graphics today, finding uses in such places as animated movies and video games. Unlike image texture maps, procedural textures typically suffer from minification ...