Sciweavers

7930 search results - page 233 / 1586
» Greedy in Approximation Algorithms
Sort
View
IJMC
2006
84views more  IJMC 2006»
15 years 6 months ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan
ECML
2005
Springer
16 years 1 days ago
Multi-armed Bandit Algorithms and Empirical Evaluation
The multi-armed bandit problem for a gambler is to decide which arm of a K-slot machine to pull to maximize his total reward in a series of trials. Many real-world learning and opt...
Joannès Vermorel, Mehryar Mohri
INFOCOM
1996
IEEE
15 years 10 months ago
ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm
In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accum...
Fred Bauer, Anujan Varma

Book
321views
17 years 4 months ago
Algorithms
"This book evolved over the past ten years from a set of lecture notes developed while teaching the undergraduate Algorithms course at Berkeley and U.C. San Diego. Our way of ...
S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani
ISCIS
2004
Springer
15 years 12 months ago
A Tabu Search Algorithm for Sparse Placement of Wavelength Converters in Optical Networks
Abstract. In this paper, we study the problem of placing limited number of wavelength converting nodes in a multi-fiber network with static traffic demands and propose a tabu sear...
Namik Sengezer, Ezhan Karasan