103 search results - page 8 / 21 » The Arithmetical Complexity of Dimension and Randomness |
IROS
2009
IEEE
14 years 3 months ago
2009
IEEE
— Sampling-based motion planners are often used to solve very high-dimensional planning problems. Many recent algorithms use projections of the state space to estimate properties...
IANDC
2011
13 years 3 months ago
2011
The present paper introduces a new model for teaching randomized learners. Our new model, though based on the classical teaching dimension model, allows to study the influence of...
ASPDAC
1998
ACM
14 years 24 days ago
1998
ACM
−This paper describes a new redundant fault identification algorithm with Exclusive-OR circuit reduction. The experimental results using this algorithm with a FAN-based test patt...
COLCOM
2007
IEEE
13 years 10 months ago
2007
IEEE
Abstract—Subscription covering detection is useful to improving the performance of any publish/subscribe system. However, an exact solution to querying coverings among a large se...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...