92 search results - page 19 / 19 » Evolving heuristically difficult instances of combinatorial ... |
UPP
2004
Springer
14 years 3 months ago
2004
Springer
Evolving solutions rather than computing them certainly represents an unconventional programming approach. The general methodology of evolutionary computation has already been know...
DAC
2001
ACM
14 years 10 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...