Sciweavers

12950 search results - page 32 / 2590
» On Optimal Timed Strategies
Sort
View
INFOCOM
1998
IEEE
13 years 12 months ago
TCP Fast Recovery Strategies: Analysis and Improvements
This paper suggests that, to match an ideal Internet gateway which rigorously enforces fair sharing among competing TCP connections, an ideal TCP sender should possess two propert...
Dong Lin, H. T. Kung
ADHOC
2010
317views more  ADHOC 2010»
13 years 4 months ago
Simple ant routing algorithm strategies for a (Multipurpose) MANET model
A Mobile Ad-hoc Network has limited and scarce resources and thus routing protocols in such environments must be kept as simple as possible. The Simple Ant Routing Algorithm (SARA...
Fernando Correia, Teresa Vazão
CIKM
2005
Springer
14 years 1 months ago
Indexing time vs. query time: trade-offs in dynamic information retrieval systems
We examine issues in the design of fully dynamic information retrieval systems with support for instantaneous document insertions and deletions. We present one such system and dis...
Stefan Büttcher, Charles L. A. Clarke
DATE
2006
IEEE
117views Hardware» more  DATE 2006»
14 years 1 months ago
Activity clustering for leakage management in SPMs
This paper we proposes compiler-based leakage optimization strategy for on-chip scratch-pad memories (SPMs). The idea is to keep only a small set of SPM regions active at a given ...
Mahmut T. Kandemir, Guangyu Chen, Feihui Li, Mary ...
COLT
2005
Springer
14 years 1 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon