15033 search results - page 140 / 3007 » Complexity Theory and Algorithms |
156
click to vote
AAAI
1996
15 years 5 months ago
1996
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
176
click to vote
BMCBI
2005
15 years 3 months ago
2005
Background: To study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computatio...
141
click to vote
CAD
2006
Springer
2006
Springer
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
15 years 3 months ago
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
158
click to vote
TCS
2008
15 years 3 months ago
2008
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
123
click to vote
BMCBI
2007
15 years 3 months ago
2007
Background: The number of algorithms available to predict ligand-protein interactions is large and ever-increasing. The number of test cases used to validate these methods is usua...