890 search results - page 35 / 178 » New Approaches to Compare Phylogenetic Search Heuristics |
108
click to vote
CP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
109
Voted
BMCBI
2008
15 years 2 months ago
2008
Background: Similarity inference, one of the main bioinformatics tasks, has to face an exponential growth of the biological data. A classical approach used to cope with this data ...
140
click to vote
TSMC
2010
14 years 8 months ago
2010
Abstract--The multimode resource-constrained projectscheduling problem with discounted cash flows (MRCPSPDCF) is important and challenging for project management. As the problem is...
131
click to vote
PPSN
2010
Springer
15 years 9 days ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
121
click to vote
HPDC
2010
IEEE
15 years 3 months ago
2010
IEEE
This paper proposes a cache hierarchy that enables Web search engines to efficiently process user queries. The different caches in the hierarchy are used to store pieces of data w...