Sciweavers

1008 search results - page 100 / 202
» Minimizing Average Flow-Time
Sort
View
73
Voted
CORR
2008
Springer
89views Education» more  CORR 2008»
15 years 23 days ago
On Endogenous Reconfiguration in Mobile Robotic Networks
: In this paper, our focus is on certain applications for mobile robotic networks, where reconfiguration is driven by factors intrinsic to the network rather than changes in the ex...
Ketan Savla, Emilio Frazzoli
54
Voted
CPC
2010
81views more  CPC 2010»
15 years 23 days ago
The Linus Sequence
Define the Linus sequence Ln for n 1 as a 0-1 sequence with L1 = 0, and Ln chosen so as to minimize the length of the longest immediately repeated block Ln-2r+1 . . . Ln-r = Ln-r...
Paul Balister, Steve Kalikow, Amites Sarkar
72
Voted
COMCOM
2006
75views more  COMCOM 2006»
15 years 21 days ago
Finding a least hop(s) path subject to multiple additive constraints
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...
Gang Cheng, Nirwan Ansari
182
Voted
COMCOM
2006
140views more  COMCOM 2006»
15 years 21 days ago
A combined delay and throughput proportional scheduling scheme for differentiated services
Abstract--The proportional differentiation model is a newly introduced approach for differentiated services networks. This paper proposes and evaluates a scheduling mechanism for t...
Ahmed E. Kamal, Samyukta Sankaran
100
Voted
CORR
2007
Springer
94views Education» more  CORR 2007»
15 years 19 days ago
Paging and Registration in Cellular Networks: Jointly Optimal Policies and an Iterative Algorithm
— This paper explores optimization of paging and registration policies in cellular networks. Motion is modeled as a discrete-time Markov process, and minimization of the discount...
Bruce Hajek, Kevin Mitzel, Sichao Yang