Sciweavers

2084 search results - page 383 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
QUESTA
2010
86views more  QUESTA 2010»
14 years 8 months ago
Dynamic admission and service rate control of a queue
This paper investigates a queueing system in which the controller can perform admission and service rate control. In particular, we examine a single server queueing system with Po...
Kranthi Mitra Adusumilli, John J. Hasenbein
SODA
2010
ACM
189views Algorithms» more  SODA 2010»
15 years 7 months ago
Correlation Clustering with Noisy Input
Correlation clustering is a type of clustering that uses a basic form of input data: For every pair of data items, the input specifies whether they are similar (belonging to the s...
Claire Mathieu, Warren Schudy
SPAA
2005
ACM
15 years 3 months ago
Value-maximizing deadline scheduling and its application to animation rendering
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
Eric Anderson, Dirk Beyer 0002, Kamalika Chaudhuri...
SIGMETRICS
2004
ACM
206views Hardware» more  SIGMETRICS 2004»
15 years 3 months ago
Performance aware tasking for environmentally powered sensor networks
The use of environmental energy is now emerging as a feasible energy source for embedded and wireless computing systems such as sensor networks where manual recharging or replacem...
Aman Kansal, Dunny Potter, Mani B. Srivastava
85
Voted
INFOCOM
2007
IEEE
15 years 4 months ago
Separability and Topology Control of Quasi Unit Disk Graphs
— A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protoco...
Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, F...