Sciweavers

672 search results - page 121 / 135
» Almost Optimal Dispersers
Sort
View
CN
1998
64views more  CN 1998»
13 years 8 months ago
Decentralized Network Connection Preemption Algorithms
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...
Mohammad Peyravian, Ajay D. Kshemkalyani
SCHOLARPEDIA
2008
92views more  SCHOLARPEDIA 2008»
13 years 8 months ago
Computational models of classical conditioning
: We describe computer simulation of a number of associative models of classical conditioning in an attempt to assess the strengths and weaknesses of each model. The behavior of th...
Nestor A. Schmajuk
MP
2011
13 years 3 months ago
Statistical ranking and combinatorial Hodge theory
We propose a number of techniques for obtaining a global ranking from data that may be incomplete and imbalanced — characteristics that are almost universal to modern datasets co...
Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye
PE
2010
Springer
212views Optimization» more  PE 2010»
13 years 3 months ago
Modeling TCP throughput: An elaborated large-deviations-based model and its empirical validation
In today's Internet, a large part of the traffic is carried using the TCP transport protocol. Characterization of the variations of TCP traffic is thus a major challenge, bot...
Patrick Loiseau, Paulo Gonçalves, Julien Ba...
IWMM
2011
Springer
245views Hardware» more  IWMM 2011»
12 years 11 months ago
Waste not, want not: resource-based garbage collection in a shared environment
To achieve optimal performance, garbage-collected applications must balance the sizes of their heaps dynamically. Sizing the heap too small can reduce throughput by increasing the...
Matthew Hertz, Stephen Kane, Elizabeth Keudel, Ton...