Sciweavers

2698 search results - page 75 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
150
Voted
ICALP
2004
Springer
15 years 8 months ago
The Minimum-Entropy Set Cover Problem
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
Eran Halperin, Richard M. Karp
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
15 years 3 months ago
Accelerating convergence using rough sets theory for multi-objective optimization problems
We propose the use of rough sets theory to improve the first approximation provided by a multi-objective evolutionary algorithm and retain the nondominated solutions using a new ...
Luis V. Santana-Quintero, Carlos A. Coello Coello
STOC
2009
ACM
87views Algorithms» more  STOC 2009»
16 years 3 months ago
Randomly supported independence and resistance
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
Per Austrin, Johan Håstad
119
Voted
FLAIRS
2000
15 years 4 months ago
Partitioning Sets with Genetic Algorithms
We first revisit a problem in the literature of genetic algorithms: arranging numbers into groups whose summed weights are as nearly equal as possible. We provide a new genetic al...
William A. Greene
121
Voted
SODA
2010
ACM
196views Algorithms» more  SODA 2010»
16 years 5 hour ago
Streaming Algorithms for extent problems in high dimensions
We develop (single-pass) streaming algorithms for maintaining extent measures of a stream S of n points in Rd . We focus on designing streaming algorithms whose working space is p...
Pankaj K Agarwal, R. Sharathkumar