500 search results - page 55 / 100 » Approximation algorithms for maximum independent set of pseu... |
NIPS
2007
15 years 3 months ago
2007
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
128
click to vote
WWW
2006
ACM
16 years 2 months ago
2006
ACM
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
111
Voted
ECCC
2000
15 years 1 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
125
Voted
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...
102
click to vote
GECCO
2010
Springer
15 years 5 months ago
2010
Springer
Originally, genetic algorithms were developed based on the binary representation of candidate solutions in which each conjectured solution is a fixed-length string of binary numb...