- Author:
- Micha Hofri
No abstract available.
Cited By
- Conflitti A (2009). Enumerating Sn by associated transpositions and linear extensions of finite posets, Discrete Mathematics, 309:8, (2020-2041), Online publication date: 1-Apr-2009.
- Jägersküpper J (2006). How the (1 + 1) ES using isotropic mutations minimizes positive definite quadratic forms, Theoretical Computer Science, 361:1, (38-56), Online publication date: 28-Aug-2006.
- Jägersküpper J Rigorous runtime analysis of the (1+1) ES Proceedings of the 8th international conference on Foundations of Genetic Algorithms, (260-281)
- Coja-Oghlan A, Goerdt A, Lanka A and Schädlich F (2004). Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT, Theoretical Computer Science, 329:1-3, (1-45), Online publication date: 13-Dec-2004.
Andreev K, Maggs B, Meyerson A and Sitaraman R Designing overlay multicast networks for streaming Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, (149-158)- Eisenstein-Taylor M (2003). Polytopes, permutation shapes and bin packing, Advances in Applied Mathematics, 30:1-2, (96-109), Online publication date: 1-Feb-2003.
- Gil J Subtyping arithmetical types Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (276-289)
- Gil J (2001). Subtyping arithmetical types, ACM SIGPLAN Notices, 36:3, (276-289), Online publication date: 1-Mar-2001.
- Li K Probabilistic analysis of an approximation algorithm for maximum subset sum using recurrence relations Proceedings of the 33rd annual on Southeast regional conference, (219-226)
- Dietz P and Raman R Persistence, amortization and randomization Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, (78-88)
- Dietzfelbinger M and Meyer auf der Heide F How to distribute a dictionary in a complete network Proceedings of the twenty-second annual ACM symposium on Theory of Computing, (117-127)
Index Terms
- Probabilistic analysis of algorithms
Recommendations
Parallel probabilistic model-building genetic algorithms with elitism
ISCIT'09: Proceedings of the 9th international conference on Communications and information technologiesThis paper presents a parallel probabilistic model-building genetic algorithms (PMBGAs) called cellular compact genetic algorithm (CCGA) with elitism. The elitismbased CCCA is a coarse-grained parallel GA that migrates probability model between nodes ...
Hybridizing firefly algorithms with a probabilistic neural network for solving classification problems
Hybridizes the firefly algorithm with simulated annealing, where simulated annealing is applied to control the randomness step inside the firefly algorithm.A Lévy flight is embedded within the firefly algorithm to better explore the search space.A ...
Hybrid Probabilistic Relational Models for System Quality Analysis
EDOC '10: Proceedings of the 2010 14th IEEE International Enterprise Distributed Object Computing ConferenceThe formalism Probabilistic Relational Models (PRM) couples discrete Bayesian Networks with a modeling formalism similar to UML class diagrams and has been used for architecture analysis. PRMs are well-suited to perform architecture analysis with ...