399 search results - page 35 / 80 » Using genetic algorithms to generate test plans for function... |
TAINN
2005
Springer
14 years 1 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
ISMVL
1997
IEEE
14 years 1 days ago
1997
IEEE
The composition tree of a given function, when it exists, provides a representation of the function revealing all possible disjunctive decompositions, thereby suggesting a realiza...
HIS
2007
13 years 9 months ago
2007
Genetic programming is known to provide good solutions for many problems like the evolution of network protocols and distributed algorithms. In such cases it is most likely a hard...
AEI
1999
13 years 7 months ago
1999
Design synthesis represents a highly complex task in the field of industrial design. The main difficulty in automating it is the definition of the design and performance spaces, i...
EOR
2007
13 years 7 months ago
2007
We introduce a master–worker framework for parallel global optimization of computationally expensive functions using response surface models. In particular, we parallelize two r...