890 search results - page 10 / 178 » New Approaches to Compare Phylogenetic Search Heuristics |
128
Voted
IJHIS
2007
15 years 1 months ago
2007
This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in...
118
click to vote
AIPS
2011
14 years 5 months ago
2011
Conformant planning can be formulated as a path-finding problem in belief space where the two main challenges are the heuristics to guide the search, and the representation and u...
140
click to vote
EOR
2010
14 years 11 months ago
2010
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
121
Voted
BMCBI
2008
15 years 1 months ago
2008
Background: Many programs have been developed to identify transcription factor binding sites. However, most of them are not able to infer two-word motifs with variable spacer leng...
100
click to vote
AIPS
2009
15 years 2 months ago
2009
In order to scale with modern processors, planning algorithms must become multi-threaded. In this paper, we present parallel shared-memory algorithms for two problems that underli...