10608 search results - page 153 / 2122 » Complexity of O'Hara's Algorithm |
ECAL
2001
Springer
14 years 2 months ago
2001
Springer
In this paper a formal approach to construction of a similarity measure for complex creatures is presented. The simulation model is described, and a Framsticks agent is expressed i...
AAAI
2007
14 years 20 days 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...
ECAI
2008
Springer
14 years 3 days 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...
UAI
2008
13 years 11 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...
NIPS
2004
13 years 11 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 ...