Sciweavers

435 search results - page 1 / 87
» Partitioning Search Spaces of a Randomized Search
Sort
View
AIIA
2009
Springer
13 years 11 months ago
Partitioning Search Spaces of a Randomized Search
This paper studies the following question: given an instance of the propositional satisfiability problem, a randomized satisfiability solver, and a cluster of n computers, what i...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...
CODES
2004
IEEE
13 years 8 months ago
Efficient search space exploration for HW-SW partitioning
Hardware/software (HW-SW) partitioning is a key problem in the codesign of embedded systems, studied extensively in the past. One major open challenge for traditional partitioning...
Sudarshan Banerjee, Nikil D. Dutt
GPEM
2000
103views more  GPEM 2000»
13 years 4 months ago
Size Fair and Homologous Tree Crossovers for Tree Genetic Programming
Abstract. Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program s...
William B. Langdon
AAAI
1996
13 years 6 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf