Sciweavers

3652 search results - page 135 / 731
» A study of query length
Sort
View
AAIM
2009
Springer
98views Algorithms» more  AAIM 2009»
14 years 2 months ago
Latency Constrained Aggregation in Chain Networks Admits a PTAS
This paper studies the aggregation of messages in networks that consist of a chain of nodes, and each message is time-constrained such that it needs to be aggregated during a give...
Tim Nonner, Alexander Souza
MICRO
2003
IEEE
124views Hardware» more  MICRO 2003»
14 years 1 months ago
Optimum Power/Performance Pipeline Depth
The impact of pipeline length on both the power and performance of a microprocessor is explored both theoretically and by simulation. A theory is presented for a wide range of pow...
Allan Hartstein, Thomas R. Puzak
WSC
2008
13 years 10 months ago
REal-time delay estimation in call centers
We use computer simulation to study the performance of alternative real-time delay estimators in heavily loaded multiserver queueing models. These delay estimates may be used to m...
Rouba Ibrahim, Ward Whitt
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 9 months ago
Improved Randomized Results for That Interval Selection Problem
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
Leah Epstein, Asaf Levin
CORR
2008
Springer
88views Education» more  CORR 2008»
13 years 8 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg