Now showing items 17466-17485 of 37378

• #### Efficient and Accurate Ethernet Simulation (revised) ﻿

(Cornell University, 1999-05)
The Internet is increasingly being called upon to provide different levels of service to different applications and users. A practical problem in doing so is that although Ethernet is one of the hops for nearly all ...
• #### An Efficient Auction Mechanism for a Production-Transportation Problem ﻿

(Cornell University Operations Research and Industrial Engineering, 2000-04)
An Efficient Auction Mechanism for a Production-Transportation Problem
• #### Efficient Average-Case Algorithms for the Modular Group ﻿

(Cornell University, 1994-04)
The modular group occupies a central position in many branches of mathematical sciences. In this paper we give average polynomial-time algorithms for the unbounded and bounded membership problems for finitely generated ...
• #### Efficient Buffering in Reliable Multicast Protocols ﻿

(Cornell University, 1999-07)
Reliable multicast protocols provide all-or-none delivery to participants. Traditionally, such protocols suffer from large buffering requirements, as receivers have to buffer messages, and buffer sizes grow with the number ...
• #### Efficient Calculation of Jacobian and Adjoint Vector Products in Wave Propagational Inverse Problems Using Automatic Differentiation ﻿

(Cornell University, 2003-01-23)
Wave propagational inverse problems arise in several applications including medical imaging and geophysical exploration. In these problems, one is interested in obtaining the parameters describing the medium from its ...
• #### Efficient Calculation of Jacobian and Adjoint Vector Products in Wave Propagational Inverse Problems Using Automatic Differentiation ﻿

(Cornell University, 2003-01-22)
Wave propagational inverse problems arise in several applications including medical imaging and geophysical exploration. In these problems, one is interested in obtaining the parameters describing the medium from its ...
• #### The Efficient Calculation of Powers of Polynomials ﻿

(Cornell University, 1972-04)
Suppose we are given a polynomial $P(x_{1},\ldots,x_{r})$ in $r \geq 1$ variables, let $m$ bound the degree of $P$ in all variables $x_{i}, l \leq i \leq r$, and we wish to raise $P$ to the $n^{th}$ power, $n>1$. In a ...
• #### Efficient CO2 Sorbents Based on Silica Foam with Ultra-large Mesopores ﻿

(Energy & Environmental Science, 2012-04-19)
A series of high-capacity, amine impregnated sorbents based on a cost-effective silica foam with ultra-large mesopores is reported. The sorbents exhibit fast CO2 capture kinetics, high adsorption capacity (of up to 5.8 ...
• #### Efficient Code Certification ﻿

(Cornell University, 1998-01)
We introduce a simple and efficient approach to the certification of compiled code. We ensure a basic but nontrivial level of code safety, including control flow safety, memory safety, and stack safety. The system is ...
• #### Efficient Computation of Interprocedural Control Dependence ﻿

(Cornell University, 2001-09-06)
Control dependence information is useful for a wide range of software maintenance and testing tasks. For example, program slicers use it to determine statements and predicates that might affect the value of a particular ...
• #### The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation ﻿

(Cornell University, 1995-12)
This paper is concerned with the efficient computation of sparse Jacobian matrices of nonlinear vector maps using automatic differentiation (AD). Specifically, we propose the use of a graph coloring technique, bi-coloring, ...
• #### The efficient computation of sparse Jacobian matrices using automaticdifferentiation ﻿

(Cornell University, 1995-11)
This paper is concerned with the efficient computation of sparse Jacobian matrices of nonlinear vector maps using automatic differentiation (AD). Specifically, we propose the use of a graph coloring technique, bi-coloring, ...
• #### An Efficient Computational Framework For Uncertainty Quantification In Multiscale Systems ﻿

(2011-01-31)
To accurately predict the performance of physical systems, it becomes essential for one to include the effects of input uncertainties into the model system and understand how they propagate and alter the final solution. ...
• #### Efficient Computational Techniques For High Dimensional Stochastic Modeling ﻿

(2013-08-19)
Modeling of physical systems in the presence of uncertainties is critical in many respects. Therefore it is necessary to quantitatively characterize these uncertainties. There are two major types of problems with respect ...
• #### Efficient Concatenable Ordered Lists ﻿

(Cornell University, 1987-04)
A new approach for providing an efficient implementation of concatenable ordered lists is discussed. The structures described have an equivalence to search trees. In balanced search trees the tree is continually modified ...
• #### Efficient Concurrency Control for Libraries of Typed Objects ﻿

(Cornell University, 1986-09)
Concurrency control algorithms use a conflict detection strategy to determine operations that have to be delayed to provide a correct serialization order. To keep the cost of detecting conflicts feasible, most algorithms ...
• #### Efficient Content Distribution With Managed Swarms ﻿

(2012-01-31)
Content distribution has become increasingly important as people have become more reliant on Internet services to provide large multimedia content. Efficiently distributing content is a complex and difficult problem: large ...
• #### Efficient Continuous-Time Dynamic Network Flow Algorithms ﻿

(Cornell University Operations Research and Industrial Engineering, 1996-08)
Efficient Continuous-Time Dynamic Network Flow Algorithms
• #### Efficient Design Of Inbound Logistics Networks ﻿

(2015-08-17)
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 ﻿

(Cornell University, 1995-06)
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 ...