2899 search results - page 348 / 580 » Dynamic Trees in Practice |
129
click to vote
ASPDAC
2001
ACM
15 years 7 months ago
2001
ACM
Clock-tuning has been classified as important but tough tasks due to the non-convex nature caused by the skew requirements. As a result, all existing mathematical programming appr...
141
click to vote
WIA
2000
Springer
15 years 7 months ago
2000
Springer
The Mona tool provides an implementation of the decision procedures for the logics WS1S and WS2S. It has been used for numerous applications, and it is remarkably efficient in prac...
116
click to vote
AAAI
2010
15 years 5 months ago
2010
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
136
click to vote
AAAI
2010
15 years 5 months ago
2010
On the surface, bidirectional search (BDS) is an attractive idea with the potential for significant asymptotic reductions in search effort. However, the results in practice often ...
130
click to vote
AAAI
2004
15 years 5 months ago
2004
Obtaining an accurate multiple alignment of protein sequences is a difficult computational problem for which many heuristic techniques sacrifice optimality to achieve reasonable r...