2168 search results - page 117 / 434 » Randomized Algorithms and Complexity Theory |
125
click to vote
ECML
1993
Springer
15 years 7 months ago
1993
Springer
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
130
click to vote
EDBT
1990
ACM
15 years 7 months ago
1990
ACM
Deductive Databases are coming of age with the emergence of efficient and easy to use systems that support queries, reasoning, and application development on databases through dec...
125
Voted
IJRR
2008
15 years 3 months ago
2008
This paper deals with minimum time trajectory optimization along a specified path subject to thermal constraints. We point out here that robots are often integrated in complex rob...
132
click to vote
ICAPR
2005
Springer
15 years 8 months ago
2005
Springer
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...
99
Voted
ECCC
2006
15 years 3 months ago
2006
Ant Colony Optimization (ACO) has become quite popular in recent years. In contrast to many successful applications, the theoretical foundation of this randomized search heuristic...