Sciweavers

2168 search results - page 275 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
QEST
2005
IEEE
15 years 9 months ago
QBDs with Marked Time Epochs: a Framework for Transient Performance Measures
A framework to assess transient performance measures is introduced by generalizing the theory of the quasi Birthand-Death (QBD) paradigm to QBDs with marked time epochs (QBDm ). T...
Benny Van Houdt, Chris Blondia
SIGCOMM
2004
ACM
15 years 9 months ago
Delayed stability and performance of distributed congestion control
Recent research efforts to design better Internet transport protocols combined with scalable Active Queue Management (AQM) have led to significant advances in congestion control...
Yueping Zhang, Seong-ryong Kang, Dmitri Loguinov
154
Voted
GECCO
2010
Springer
129views Optimization» more  GECCO 2010»
15 years 8 months ago
A probabilistic functional crossover operator for genetic programming
The original mechanism by which evolutionary algorithms were to solve problems was to allow for the gradual discovery of sub-solutions to sub-problems, and the automated combinati...
Josh C. Bongard
ATAL
2010
Springer
15 years 4 months ago
A graph-theoretic approach to protect static and moving targets from adversaries
The static asset protection problem (SAP) in a road network is that of allocating resources to protect vertices, given any possible behavior by an adversary determined to attack t...
John P. Dickerson, Gerardo I. Simari, V. S. Subrah...
249
Voted
ICDCS
2012
IEEE
13 years 6 months ago
DARD: Distributed Adaptive Routing for Datacenter Networks
Datacenter networks typically have many paths connecting each host pair to achieve high bisection bandwidth for arbitrary communication patterns. Fully utilizing the bisection ban...
Xin Wu, Xiaowei Yang