JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing by Title
Now showing items 1754417563 of 37676

Efficient Design Of Inbound Logistics Networks
Dong, Zhijie (20150817)Logistics is a vitally important part of the economy, and it is now a $1.45 trillion industry in the United States representing 8.3 percent of GDP. Efficient design of routes and schedules for moving materials into ... 
Efficient Dynamic Network Flow Algorithms
Hoppe, Bruce (Cornell University, 199506)Dynamic network flows model transportation. A dynamic network consists of a graph with capacities and transit times on its edges. Flow moves through a dynamic network over time. Edge capacities restrict the rate of ... 
Efficient Error Recovery For Reliable Multicast
Xiao, Zhen (Cornell University, 20010103)Multicast is an efficient mechanism for distributing data from one sender to multiple receivers. Many applications need a reliable multicast service which is not provided by the existing IP multicast protocol. Providing ... 
Efficient Estimations from a Slowly Convergent RobbinsMonro Process
Ruppert, D. (Cornell University Operations Research and Industrial Engineering, 198802)Efficient Estimations from a Slowly Convergent RobbinsMonro Process 
Efficient Generation of Memory Reference Strings Based on the LRU Stack Model of Program Behaviour
Babaoglu,Ozalp (Cornell University, 198110)We consider the problem of generating memory reference strings that are to be used instead of real program address traces with the generator based on the LeastRecentlyUsed Stack Model (LRUSM) of program behaviour. A ... 
Efficient Geometric Algorithms for Robot Sensing and Control
Briggs, Amy (Cornell University, 199502)This thesis addresses the problem of automatically generating solutions to robotics tasks that are specified at a high level. In particular, we consider the problems of robot motion planning and the planning of sensor ... 
Efficient group sequential designs when there are several effect sizes under consideration
Jennison, C.; Turnbull, B. (Cornell University Operations Research and Industrial Engineering, 200410)Efficient group sequential designs when there are several effect sizes under consideration 
Efficient Hierarchical Radiosity in Complex Environments
Smits, Brian Edward (Cornell University, 199408)This thesis presents methods for speeding up the global illumination computations by using bounds on error to eliminate work that is not needed for a solution of a given accuracy. This work makes the hieerarchical ... 
The Efficient Implementation of VeryHighLevel Programming Language Constructs
Hood, Robert T. (Cornell University, 198208)An investigation is made into efficientlyimplementable veryhighlevel programming language constructs. In a manner analogous to ALGOL 60's abstraction away from GOTO's, an abstract replacement for pointers (the path) ... 
Efficient Inverted Lists and Query Algorithms for Structured Value Ranking in UpdateIntensive Relational Databases
Guo, Lin; Shanmugasundaram, Jayavel; Beyer, Kevin; Shekita, Eugene (Cornell University, 20040706)We propose a new ranking paradigm for relational databases called Structured Value Ranking (SVR). SVR uses {\em structured data values} to score (rank) the results of keyword search queries over text columns. Our main ... 
Efficient Keyword Search over Virtual XML Views
Shao, Feng; Guo, Lin; Botev, Chavdar; Bhaskar, Anand; Chettiah, Muthiah; Yang, Fan; Shanmugasundaram, Jayavel (Cornell University, 20070322)Emerging applications such as personalized portals, enterprise search and web integration systems often require keyword search over semistructured views. However, traditional information retrieval techniques are likely ... 
An Efficient Linear Scaling Algorithm for Tight Bonding Molecular Dynamics
Goedecker, S.; Colombo, L. (Cornell University, 199403)A novel formulation for tight binding total energy calculations and tight binding molecular dynamics, which scales linearily with the size of the system, is presented. The linear complexity allows us to treat systems of ... 
Efficient LocationAware Node And Object Discovery In LargeScale Networks
Wong, Bernard (20110831)The performance of many distributed systems is highly sensitive to the latency of finding objects in response to user requests. Efficient discovery of nodes and objects in the network that satisfy applicationspecific ... 
Efficient Message Passing Interface (MPI) for Parallel Computing onClusters of Workstations
Bruck, Jehoshua; Dolev, Danny; Ho, ChingTien; Rosu, MarcelCatalin; Strong, Ray (Cornell University, 199502)Parallel computing on clusters of workstations and personal computers has very high potential, since it leverages existing hardware and software. Parallel programming environments offer the user a convenient way to express ... 
Efficient Modeling Of Higher Order And Longer Range Geometry Statistics
Zhang, Yimeng (20130128)The local feature based approaches have become popular in most vision applications. A local feature captures the local appearance of objects or scenes, and is more robust to environment and viewpoint changes comparing to ... 
Efficient MultiObjective Surrogate Optimization Of Computationally Expensive Models With Application To Watershed Model Calibration
Akhtar, Taimoor (20150817)This thesis introduces efficient algorithms for multiobjective optimization of computationally expensive simulation optimization problems. Implementation of efficient algorithms and their advantage of use for calibration ... 
Efficient OnLine Construction and Correction of Position Trees
Majster, Mila E. (Cornell University, 197910)This paper presents an online algorithm for the construction of position trees, i.e. an algorithm which constructs the position tree for a given string while reading the string from left to right. In addition, an online ... 
Efficient Optimization Of Computationally Expensive Problems Using A New Parallel Algorithm And Response Surface Based Methods
Singh, Amandeep (20110531)This thesis concerns the development and implementation of efficient optimization algorithms for simulation based functions (real world problems) that are computationally expensive to evaluate. The first contribution is a ... 
Efficient Parallel Algorithms for Covering Binary Images
Moitra, Dipen (Cornell University, 198905)Given a black and white image, represented by an array of $\surd$ n x $\surd$ n binary valued pixels, we wish to cover the black pixels with a minimal set of (possible overlapping) maximal squares. It was recently shown ... 
Efficient Parallel Algorithms for Disjoint Paths and Connectivity
Khuller, Samir (Cornell University, 199007)This thesis is concerned with the problem of designing efficient parallel algorithms for various graphtheoretic problems. Our larger goal is to identify "tools" that would be useful in designing parallel algorithms for ...