1529 search results - page 79 / 306 » Search Space Analysis of the Linear Ordering Problem |
112
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
161
click to vote
GLVLSI
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper, we address the problem of the efficient exploration of the architectural design space for parameterized systems. Since the design space is multi-objective, our aim ...
132
click to vote
BMCBI
2007
15 years 3 months ago
2007
Background: Features of a DNA sequence can be found by compressing the sequence under a suitable model; good compression implies low information content. Good DNA compression mode...
204
click to vote
ICRA
2010
IEEE
15 years 1 months ago
2010
IEEE
Aerial vehicles are appealing systems for possible future exploration of planets and moons such as Venus and Titan, because they combine extensive coverage with highresolution data...
119
click to vote
CP
2000
Springer
15 years 8 months ago
2000
Springer
Random Noise and Random Walk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis o...