281 search results - page 46 / 57 » Code Compaction Using Genetic Algorithms |
CP
2003
Springer
13 years 12 months ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
DIALM
2007
ACM
13 years 10 months ago
2007
ACM
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
DCC
2002
IEEE
14 years 6 months ago
2002
IEEE
We present a technique designed aiming to improve the compression of the Edgebreaker CLERS string for large and regular meshes, where regularity is understood as the compactness o...
AIIDE
2006
13 years 8 months ago
2006
Reinforcement learning is an effective machine learning paradigm in domains represented by compact and discrete state-action spaces. In high-dimensional and continuous domains, ti...
SIGSOFT
2010
ACM
13 years 4 months ago
2010
ACM
Test suite augmentation techniques are used in regression testing to identify code elements affected by changes and to generate test cases to cover those elements. Our preliminary...