432 search results - page 20 / 87 » An optimal algorithm for the distinct elements problem |
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
Recent work has provided functions that can be used to prove a principled distinction between the capabilities of mutation-based and crossover-based algorithms. However, prior fun...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
SPAA
1993
ACM
14 years 26 days ago
1993
ACM
We consider several natural broadcasting problems for the LogP model of distributed memory machines recently proposed by Culler et al. For each of these problems, we present algor...
DAM
2008
13 years 8 months ago
2008
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
GECCO
2010
Springer
14 years 12 days ago
2010
Springer
Test suite augmentation techniques are used in regression testing to help engineers identify code elements affected by changes, and generate test cases to cover those elements. R...