Sciweavers

5316 search results - page 70 / 1064
» Which Search Problems Are Random
Sort
View
VMV
2001
209views Visualization» more  VMV 2001»
15 years 2 months ago
A Novel Probabilistic Model for 3D Object Recognition: Spin-Glass Markov Random Fields
This contribution presents a new class of MRF, that is inspired by methods of statistical physics. The new energy function assumes full-connectivity in the neighborhood system and...
Barbara Caputo, Sahla Bouattour, Dietrich Paulus
CIA
2003
Springer
15 years 6 months ago
A Peer-to-Peer Approach to Resource Discovery in Multi-agent Systems
A multi-agent system is a network of software agents that cooperate to solve problems. In open multi-agent systems, the agents that need resources provided by other agents are not ...
Vassilios V. Dimakopoulos, Evaggelia Pitoura
AIPS
2009
15 years 1 months ago
Computing Robust Plans in Continuous Domains
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
Christian Fritz, Sheila A. McIlraith
COCOON
2009
Springer
15 years 7 months ago
Sublinear-Time Algorithms for Tournament Graphs
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
Stefan S. Dantchev, Tom Friedetzky, Lars Nagel
AAAI
1998
15 years 2 months ago
Optimal 2D Model Matching Using a Messy Genetic Algorithm
A Messy Genetic Algorithm is customized toflnd'optimal many-to-many matches for 2D line segment models. The Messy GA is a variant upon the Standard Genetic Algorithm in which...
J. Ross Beveridge