15 search results - page 2 / 3 » Structural Properties of Incomplete Hypercube Computers |
ICTAI
1999
IEEE
13 years 12 months ago
1999
IEEE
Recently there has been significant progress in our understanding of the computational nature of combinatorial problems. Randomized search methods, both complete and incomplete, o...
STACS
2001
Springer
14 years 1 days ago
2001
Springer
We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...
IJAR
2011
13 years 2 months ago
2011
Abstract. In this paper, we introduce a general and modular framework for formalizing reasoning with incomplete and inconsistent information. Our framework is composed of non-deter...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
FOCS
2009
IEEE
13 years 5 months ago
2009
IEEE
We give a new model of learning motivated by smoothed analysis (Spielman and Teng, 2001). In this model, we analyze two new algorithms, for PAC-learning DNFs and agnostically learn...