829 search results - page 109 / 166 » Bandit Algorithms for Tree Search |
GECCO
2006
Springer
15 years 1 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...
IFIP
2009
Springer
15 years 4 months ago
2009
Springer
New Internet services and technologies call for higher packet switching capacities in the core network. Thus, a performance bottleneck arises at the backbone routers, as forwarding...
ISCAS
2008
IEEE
15 years 4 months ago
2008
IEEE
— Since the complexity of MIMO detection algorithms is exponential, the K–best algorithm is often chosen for efficient VLSI implementation. This detection problem is often view...
CP
2005
Springer
15 years 3 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
SC
2000
ACM
15 years 2 months ago
2000
ACM
Recent advances in DNA sequencing technology have created large data sets upon which phylogenetic inference can be performed. However, current research is limited by the prohibiti...