Sciweavers

15033 search results - page 39 / 3007
» Complexity Theory and Algorithms
Sort
View
TPHOL
2005
IEEE
15 years 3 months ago
A HOL Theory of Euclidean Space
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
John Harrison
ECML
1993
Springer
15 years 1 months ago
Complexity Dimensions and Learnability
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...
Shan-Hwei Nienhuys-Cheng, Mark Polman
EDBT
1990
ACM
108views Database» more  EDBT 1990»
15 years 1 months ago
Deductive Databases - Theory Meets Practice
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...
Carlo Zaniolo
IJRR
2008
73views more  IJRR 2008»
14 years 9 months ago
Optimization of Complex Robot Applications under Real Physical Limitations
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...
Matthieu Guilbert, Luc D. Joly, Pierre-Brice Wiebe...
CORR
2010
Springer
119views Education» more  CORR 2010»
14 years 4 months ago
Effective complexity of stationary process realizations
The concept of effective complexity of an object as the minimal description length of its regularities has been initiated by Gell-Mann and Lloyd. The regularities are modeled by m...
Nihat Ay, Markus Müller, Arleta Szkola