JDA
2006
13 years 11 months ago
2006
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
EOR
2008
13 years 11 months ago
2008
For the p-median problem we study complexity of finding a local minimum in the worst and the average cases. We introduce several neighborhoods and show that the corresponding loca...
DAM
2008
13 years 11 months ago
2008
ct The average case analysis of algorithms usually assumes independent, identical distributions for the inputs. In [?], Kenyon introduced the random-order ratio, a new average case...
JTRES
2010
ACM
13 years 11 months ago
2010
ACM
In order to guarantee that real-time systems meet their timing specification, static execution time bounds need to be calculated. Not considering execution time predictability led...
DAGSTUHL
2004
14 years 9 days ago
2004
Nonlinear approximation has usually been studied under deterministic assumptions and complete information about the underlying functions. In the present paper we assume only partia...
FSTTCS
1991
Springer
14 years 2 months ago
1991
Springer
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
ANTS
2006
Springer
14 years 2 months ago
2006
Springer
Despite their popularity, lattice reduction algorithms remain mysterious in many ways. It has been widely reported that they behave much more nicely than what was expected from the...
ICML
1990
IEEE
14 years 2 months ago
1990
IEEE
We present an approach to modeling the average case behavior of learning algorithms. Our motivation is to predict the expected accuracy of learning algorithms as a function of the...