432 search results - page 28 / 87 » An optimal algorithm for the distinct elements problem |
117
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
136
click to vote
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
123
click to vote
TKDE
2010
15 years 1 months ago
2010
—Duplicates in data streams may often be observed by the projection on a subspace and/or multiple recordings of objects. Without the uniqueness assumption on observed data elemen...
109
click to vote
JSCIC
2010
14 years 10 months ago
2010
A new way of devising numerical methods is introduced whose distinctive feature is the computation of a finite element approximation only in a polyhedral subdomain D of the origina...
98
Voted
ASPDAC
2004
ACM
15 years 8 months ago
2004
ACM
- Data path connection elements, such as multiplexers, consume a significant amount of area on a VLSI chip, especially for FPGA designs. Multiplexer optimization is a difficult pro...