Sciweavers

716 search results - page 34 / 144
» Algorithmic Issues in Coding Theory
Sort
View
ICALP
2005
Springer
15 years 8 months ago
Randomized Fast Design of Short DNA Words
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...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
15 years 7 months ago
Search space modulation in genetic algorithms: evolving the search space by sinusoidal transformations
An experimental form of Modulation (Reinterpretation) of the Search Space is presented. This modulation is developed as a mathematical method that can be implemented directly into...
José Antonio Martin H.
112
Voted
SAC
2009
ACM
15 years 9 months ago
Evaluating algorithms that learn from data streams
In the past years, the theory and practice of machine learning and data mining have been focused on static and finite data sets from where learning algorithms generate a static m...
João Gama, Pedro Pereira Rodrigues, Raquel ...
MANSCI
2006
121views more  MANSCI 2006»
15 years 2 months ago
Methodologies and Algorithms for Group-Rankings Decision
The problem of group ranking, a.k.a. rank aggregation, has been studied in contexts varying from sports, to multi-criteria decision making, to machine learning, to ranking web pag...
Dorit S. Hochbaum, Asaf Levin
136
Voted
FPGA
2007
ACM
150views FPGA» more  FPGA 2007»
15 years 8 months ago
FPGA-friendly code compression for horizontal microcoded custom IPs
Shrinking time-to-market and high demand for productivity has driven traditional hardware designers to use design methodologies that start from high-level languages. However, meet...
Bita Gorjiara, Daniel Gajski