2084 search results - page 113 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
128
Voted
COLT
2007
Springer
15 years 8 months ago
2007
Springer
This paper analyzes the potential advantages and theoretical challenges of “active learning” algorithms. Active learning involves sequential sampling procedures that use infor...
103
Voted
COLT
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
115
Voted
ISCAS
2005
IEEE
15 years 8 months ago
2005
IEEE
— Simulated Evolution (SimE) is a sound stochastic approximation algorithm based on the principles of adaptation. If properly engineered it is possible for SimE to reach nearopti...
109
Voted
SAT
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
135
Voted
SODA
2008
ACM
15 years 4 months ago
2008
ACM
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...