Sciweavers

5329 search results - page 175 / 1066
» The Weighted Majority Algorithm
Sort
View
119
Voted
VTC
2006
IEEE
159views Communications» more  VTC 2006»
15 years 8 months ago
Comparison between Vertical Handoff Decision Algorithms for Heterogeneous Wireless Networks
— The next generation wireless networks will support the vertical handoff mechanism in which users can maintain the connections when they switch from one network to another (e.g....
Enrique Stevens-Navarro, Vincent W. S. Wong
147
Voted
APPROX
2005
Springer
150views Algorithms» more  APPROX 2005»
15 years 8 months ago
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
Julián Mestre
128
Voted
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
15 years 8 months ago
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
Bryant A. Julstrom
140
Voted
ICGA
1993
296views Optimization» more  ICGA 1993»
15 years 4 months ago
A Genetic Algorithm Applied to the Maximum Flow Problem
A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacit...
Toshinori Munakata, David J. Hashier
100
Voted
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
15 years 9 months ago
Iterative Rounding for Multi-Objective Optimization Problems
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
Fabrizio Grandoni, R. Ravi, Mohit Singh