Sciweavers

472 search results - page 28 / 95
» Design of Iterated Local Search Algorithms
Sort
View
DATE
2010
IEEE
119views Hardware» more  DATE 2010»
15 years 2 months ago
Exploiting local logic structures to optimize multi-core SoC floorplanning
Abstract—We present a throughput-driven partitioning algorithm and a throughput-preserving merging algorithm for the high-level physical synthesis of latency-insensitive (LI) sys...
Cheng-Hong Li, Sampada Sonalkar, Luca P. Carloni
94
Voted
EVOW
2009
Springer
15 years 2 months ago
Finding Balanced Incomplete Block Designs with Metaheuristics
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
David Rodríguez Rueda, Carlos Cotta, Antoni...
RECOMB
2004
Springer
15 years 10 months ago
Designing multiple simultaneous seeds for DNA similarity search
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
Yanni Sun, Jeremy Buhler
CORR
2008
Springer
118views Education» more  CORR 2008»
14 years 9 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg
ESANN
2003
14 years 11 months ago
Robust Vector Quantization for Burst Error Channels Using Genetic Algorithm
This paper presents a novel vector quantizer (VQ) design algorithm for a burst error channel (BEC). The algorithm minimizes the average distortion when the BEC is in normal state o...
Wen-Jyi Hwang, Chien-Min Ou, Chin-Ming Yeh