914 search results - page 58 / 183 » Analysis of Heuristic Synergies |
127
click to vote
TON
2010
14 years 6 months ago
2010
Abstract--Every congestion control protocol operating in wireless networks is potentially faced with two major challenges of performance degradation. These sources are (a) the coup...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
102
click to vote
ACSC
2005
IEEE
15 years 5 months ago
2005
IEEE
Collaborative Software Engineering (CSE) supports the fine-grained real-time development of software by teams of developers located anywhere on the Internet. In this paper we des...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration o...
CORR
2007
Springer
14 years 12 months ago
2007
Springer
Abstract. The Boolean satisfiability problem (SAT) can be solved efficiently with variants of the DPLL algorithm. For industrial SAT problems, DPLL with conflict analysis depend...