Sciweavers

1316 search results - page 164 / 264
» A New Scheduling Algorithm for Servers
Sort
View
INFOCOM
2008
IEEE
14 years 4 months ago
Multihop Local Pooling for Distributed Throughput Maximization in Wireless Networks
Abstract—Efficient operation of wireless networks requires distributed routing and scheduling algorithms that take into account interference constraints. Recently, a few algorit...
Gil Zussman, Andrew Brzezinski, Eytan Modiano
CP
2009
Springer
14 years 11 months ago
Search Spaces for Min-Perturbation Repair
Many problems require minimally perturbing an initial state in order to repair some violated constraints. We consider two search spaces for exactly solving this minimal perturbatio...
Alex S. Fukunaga
ICAPR
2005
Springer
14 years 3 months ago
Symmetric Hash Functions for Fingerprint Minutiae
Abstract. The possibility that a database with biometric data is compromised is one of the main concerns in implementing biometric identification systems. In this paper we present...
Sergey Tulyakov, Faisal Farooq, Venu Govindaraju
INFOCOM
2011
IEEE
13 years 1 months ago
Dynamic right-sizing for power-proportional data centers
—Power consumption imposes a significant cost for data centers implementing cloud services, yet much of that power is used to maintain excess service capacity during periods of ...
Minghong Lin, Adam Wierman, Lachlan L. H. Andrew, ...
INFOCOM
2002
IEEE
14 years 3 months ago
BSFQ: Bin Sort Fair Queueing
—Existing packet schedulers that provide fair sharing of an output link can be divided into two classes: sorted priority and frame-based. Sorted priority methods provide excellen...
Shun Yan Cheung, Corneliu S. Pencea