3320 search results - page 91 / 664 » Heuristics for the Phylogeny Problem |
230
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
164
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Satisfiability testing (SAT) is a very active area of research today, with numerous real-world applications. We describe CLASS2.0, a genetic programming system for semi-automatica...
186
click to vote
HCI
2009
15 years 3 months ago
2009
Heuristic evaluations are an efficient low cost method for identifying usability problems in a biomedical research tool. Combining the results of these evaluations with findings fr...
157
click to vote
ICCAD
2001
IEEE
16 years 3 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
161
click to vote
AIPS
2000
15 years 7 months ago
2000
The formulation of planning as heuristic search with heuristics derived from problem representations has turned out to be a fruitful approach for classical planning. In this paper...