Probabilistic alternatives for competitive analysis
نویسندگان
چکیده
منابع مشابه
Alternatives to competitive analysis
Competitive analysis allows us to make strong theoretical statements about the performance of an algorithm without making probabilistic assumptions on the inputs. However, it has been often criticized with respect to its realism. A wide range of online algorithms –both good and not so good in practice– seem to have the same competitive ratio. A concrete example of this is the inability of compe...
متن کاملDynamic Competitive Probabilistic Principal Components Analysis
We present a new neural model which extends the classical competitive learning (CL) by performing a Probabilistic Principal Components Analysis (PPCA) at each neuron. The model also has the ability to learn the number of basis vectors required to represent the principal directions of each cluster, so it overcomes a drawback of most local PCA models, where the dimensionality of a cluster must be...
متن کاملA probabilistic cooperative-competitive hierarchical model for global optimization
Stochastic searching methods have been applied widely to areas such as continuous and combinatorial optimization problems in a number of disciplines. Many existing methods solve these problems by navigating on the surface of the possibly rugged landscape. This kind of navigation is not very effective because the property of the landscape at different resolutions can be very different. Time spen...
متن کاملCompetitive Algorithms for Online Leasing Problem in Probabilistic Environments
We integrate probability distribution into pure competitive analysis to improve the performance measure of competitive analysis, since input sequences of the leasing problem have simple structure and favorably statistical property. Let input structures be the characteristic of geometric distribution, and we obtain optimal on-line algorithms and their competitive ratios. Moreover, the introducin...
متن کاملCompetitive nucleation in reversible probabilistic cellular automata.
The problem of competitive nucleation in the framework of probabilistic cellular automata is studied from the dynamical point of view. The dependence of the metastability scenario on the self-interaction is discussed. An intermediate metastable phase, made of two flip-flopping chessboard configurations, shows up depending on the ratio between the magnetic field and the self-interaction. A behav...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science - Research and Development
سال: 2011
ISSN: 1865-2034,1865-2042
DOI: 10.1007/s00450-011-0149-1