5580 search results - page 227 / 1116 » Randomized priority algorithms |
125
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
140
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Various methods for ensemble selection and classifier combination have been designed to optimize the results of ensembles of classifiers. Genetic algorithm (GA) which uses the div...
126
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
140
click to vote
SAC
2008
ACM
15 years 4 months ago
2008
ACM
The weakly pulse-coupled oscillator framework has proven to be a valuable resource for the development of peer-to-peer synchronization algorithms [9]. But leveraging it in a pract...
164
click to vote
CORR
2011
Springer
15 years 3 days ago
2011
Springer
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...