Sciweavers

503 search results - page 58 / 101
» Verifying Quantitative Properties Using Bound Functions
Sort
View
RTCSA
1997
IEEE
15 years 1 months ago
Behavior verification of hybrid real-time requirements by qualitative formalism
Although modern control theories have been successfully applied to solve a variety of problems, they are often mathematically and physically too specific to describe and analyze t...
Jang-Soo Lee, Sung Deok Cha
NECO
2008
116views more  NECO 2008»
14 years 9 months ago
A (Somewhat) New Solution to the Variable Binding Problem
To perform automatic, unconscious inference, the human brain must solve the "binding problem" by correctly grouping properties with objects. Temporal binding models like...
Leon Barrett, Jerome Feldman, Liam Mac Dermed
ROBOTICA
2006
116views more  ROBOTICA 2006»
14 years 9 months ago
Hybrid velocity/force control for robot navigation in compliant unknown environments
We combine a "hybrid" force/position control scheme with a potential field approach into a novel method for collision recovery and navigation in unknown environments. It...
Dushyant Palejiya, Herbert G. Tanner
JMLR
2002
75views more  JMLR 2002»
14 years 9 months ago
Stability and Generalization
We define notions of stability for learning algorithms and show how to use these notions to derive generalization error bounds based on the empirical error and the leave-one-out e...
Olivier Bousquet, André Elisseeff
ML
2007
ACM
106views Machine Learning» more  ML 2007»
14 years 9 months ago
Surrogate maximization/minimization algorithms and extensions
Abstract Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. A...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung