Sciweavers

236 search results - page 36 / 48
» heuristics 2002
Sort
View
GPEM
2002
163views more  GPEM 2002»
14 years 9 months ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf
79
Voted
JACM
2002
94views more  JACM 2002»
14 years 9 months ago
The greedy path-merging algorithm for contig scaffolding
Given a collection of contigs and mate-pairs. The Contig Scaffolding Problem is to order and orientate the given contigs in a manner that is consistent with as many mate-pairs as p...
Daniel H. Huson, Knut Reinert, Eugene W. Myers
97
Voted
JOC
2002
99views more  JOC 2002»
14 years 9 months ago
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
Phong Q. Nguyen, Igor Shparlinski
JUCS
2002
93views more  JUCS 2002»
14 years 9 months ago
On the Semiautomatic Generation of WordNet Type Synsets and Clusters
: WordNet (WN) is a lexical knowledge base, first developed for English and then adopted for several Western European languages, which was created as a machinereadable dictionary b...
Florentina Hristea
71
Voted
MICRO
2002
IEEE
121views Hardware» more  MICRO 2002»
14 years 9 months ago
Convergent scheduling
Convergent scheduling is a general framework for instruction scheduling and cluster assignment for parallel, clustered architectures. A convergent scheduler is composed of many ind...
Walter Lee, Diego Puppin, Shane Swenson, Saman P. ...