5138 search results - page 194 / 1028 » Randomized Algorithms for 3-SAT |
158
click to vote
IWOCA
2009
Springer
16 years 1 months ago
2009
Springer
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
142
click to vote
CSR
2007
Springer
16 years 18 days ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
146
click to vote
ICALP
2005
Springer
15 years 12 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...
167
click to vote
GECCO
2006
Springer
15 years 10 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...
144
click to vote
CORR
2010
Springer
15 years 6 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...