348 search results - page 18 / 70 » Using Curvature Information for Fast Stochastic Search |
105
Voted
JAIR
2008
14 years 9 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
SIGIR
2002
ACM
14 years 9 months ago
2002
ACM
Users of the World-Wide Web are not only confronted by an immense overabundance of information, but also by a plethora of tools for searching for the web pages that suit their inf...
104
click to vote
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
In this paper, we propose a high-order graph matching formulation to address non-rigid surface matching. The singleton terms capture the geometric and appearance similarities (e.g...
NIPS
2007
14 years 11 months ago
2007
Dynamic Bayesian networks are structured representations of stochastic processes. Despite their structure, exact inference in DBNs is generally intractable. One approach to approx...
HICSS
1994
IEEE
15 years 1 months ago
1994
IEEE
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...