10988 search results - page 216 / 2198 » Algorithmic Folding Complexity |
112
click to vote
AAAI
2007
15 years 6 months ago
2007
We study the behavior of the classical A∗ search algorithm when coupled with a heuristic that provides estimates, accurate to within a small multiplicative factor, of the distan...
115
click to vote
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. A common way of dealing with the paradoxes of preference aggregation consists in restricting the domain of admissible preferences. The most well-known such restriction is...
131
Voted
UAI
2008
15 years 5 months ago
2008
It is well-known that inference in graphical models is hard in the worst case, but tractable for models with bounded treewidth. We ask whether treewidth is the only structural cri...
122
click to vote
NIPS
2004
15 years 5 months ago
2004
We propose to selectively remove examples from the training set using probabilistic estimates related to editing algorithms (Devijver and Kittler, 1982). This heuristic procedure ...
100
click to vote
DAM
2006
15 years 3 months ago
2006
In the paper, the computational complexity of several variants of the problem of isothermic DNA sequencing by hybridization, is analyzed. The isothermic sequencing is a recent met...