Sciweavers

545 search results - page 11 / 109
» Simultaneous approximation by greedy algorithms
Sort
View
COLOGNETWENTE
2008
13 years 10 months ago
Special Cases of Online Parallel Job Scheduling
In this paper we consider the online scheduling of jobs, which require processing on a number of machines simultaneously. These jobs are presented to a decision maker one by one, ...
Johann Hurink, Jacob Jan Paulus
WSC
2001
13 years 9 months ago
Global random optimization by simultaneous perturbation stochastic approximation
We examine the theoretical and numerical global convergence properties of a certain "gradient free" stochastic approximation algorithm called the "simultaneous pertu...
John L. Maryak, Daniel C. Chin
CDC
2010
IEEE
146views Control Systems» more  CDC 2010»
13 years 3 months ago
Adaptive autonomous soaring of multiple UAVs using Simultaneous Perturbation Stochastic Approximation
Abstract-- This paper presents a new algorithm for maximizing the flight duration of a single UAV (Uninhabited Air Vehicle) and UAVs group using the thermal model developed by Alle...
Cathrine Antal, Oleg Granichin, Sergey Levi
INFOCOM
2009
IEEE
14 years 3 months ago
Minimizing the Cost of Mine Selection Via Sensor Networks
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
Changlei Liu, Guohong Cao
SODA
2001
ACM
102views Algorithms» more  SODA 2001»
13 years 9 months ago
Approximate majorization and fair online load balancing
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
Ashish Goel, Adam Meyerson, Serge A. Plotkin