Sciweavers

5138 search results - page 301 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
ESA
2006
Springer
82views Algorithms» more  ESA 2006»
15 years 10 months ago
Preemptive Online Scheduling: Optimal Algorithms for All Speeds
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet...
Tomás Ebenlendr, Wojciech Jawor, Jiri Sgall
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 6 months ago
Local Information Based Algorithms for Packet Transport in Complex Networks
Abstract. We introduce four algorithms for packet transport in complex networks. These algorithms use deterministic rules which depend, in different ways, on the degree of the node...
Bernard Kujawski, G. J. Rodgers, Bosiljka Tadic
ECCC
2006
97views more  ECCC 2006»
15 years 6 months ago
Runtime Analysis of a Simple Ant Colony Optimization Algorithm
Ant Colony Optimization (ACO) has become quite popular in recent years. In contrast to many successful applications, the theoretical foundation of this randomized search heuristic...
Frank Neumann, Carsten Witt
EOR
2007
147views more  EOR 2007»
15 years 6 months ago
Routing and wavelength assignment in optical networks using bin packing based algorithms
This paper addresses the problem of routing and wavelength assignment (RWA) of static lightpath requests in wavelength routed optical networks. The objective is to minimize the nu...
Nina Skorin-Kapov
ICDM
2007
IEEE
138views Data Mining» more  ICDM 2007»
16 years 28 days ago
Bandit-Based Algorithms for Budgeted Learning
We explore the problem of budgeted machine learning, in which the learning algorithm has free access to the training examples’ labels but has to pay for each attribute that is s...
Kun Deng, Chris Bourke, Stephen D. Scott, Julie Su...