Sciweavers

2297 search results - page 112 / 460
» An Algorithm for Computing the Integral Closure
Sort
View
INFOCOM
1993
IEEE
14 years 1 months ago
A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case
Worst-casebounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of Generalized Processor Sharing (GPS) 10] servers. The inhe...
Abhay K. Parekh, Robert G. Gallager
INFOCOM
2008
IEEE
14 years 3 months ago
Stability and Delay Bounds in Heterogeneous Networks of Aggregate Schedulers
—Aggregate scheduling is one of the most promising solutions to the issue of scalability in networks, like DiffServ networks and high speed switches, where hard QoS guarantees ar...
Gianluca Rizzo, Jean-Yves Le Boudec
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
14 years 20 days ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
WWW
2010
ACM
13 years 9 months ago
Finding algorithms in scientific articles
Algorithms are an integral part of computer science literature. However, none of the current search engines offer specialized algorithm search facility. We describe a vertical sea...
Sumit Bhatia, Prasenjit Mitra, C. Lee Giles
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 9 months ago
Detecting Danger: The Dendritic Cell Algorithm
l invaders in the form of pathogens. In this research, and abstract model of DC behaviour is developed and subsequently used to form an algorithm, the DCA. The abstraction process ...
Julie Greensmith, Uwe Aickelin, Steve Cayzer