Sciweavers

5153 search results - page 439 / 1031
» Introduction to Randomized Algorithms
Sort
View
GLOBECOM
2007
IEEE
16 years 14 days ago
An Exact Solution to an Approximated Model of RED
— In this paper, we propose an analytical model to capture the dynamics of the RED algorithm. We first develop a system of recursive equations that describes the packet dropping...
Claus Bauer, Homayoun Yousefi'zadeh, Hamid Jafarkh...
ISCAS
2005
IEEE
114views Hardware» more  ISCAS 2005»
15 years 11 months ago
Structured stochastic optimization strategies for problems with ill-conditioned error surfaces
—This paper compares the performance of several structured optimization strategies in adaptive signal processing problems that are characterized by ill-conditioned error surfaces...
S. Pal, Dean J. Krusienski, W. Kenneth Jenkins
ESA
2005
Springer
140views Algorithms» more  ESA 2005»
15 years 11 months ago
Bucket Game with Applications to Set Multicover and Dynamic Page Migration
We present a simple two-person Bucket Game, based on throwing balls into buckets, and we discuss possible players’ strategies. We use these strategies to create an approximation ...
Marcin Bienkowski, Jaroslaw Byrka
170
Voted
OR
2005
Springer
15 years 11 months ago
Open Vehicle Routing Problem with Time Deadlines: Solution Methods and an Application
In the open route version of the well-known vehicle routing problem, vehicles are not required to return to the depot; or if they are required, then they return by traveling the sa...
Zeynep Özyurt, Deniz Aksen, Necati Aras
STACS
2004
Springer
15 years 11 months ago
Optimal and Online Preemptive Scheduling on Uniformly Related Machines
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
Tomás Ebenlendr, Jiri Sgall