default search action
Theoretical Computer Science, Volume 561
Volume 561, Part A, January 2015
Preface
- Tobias Friedrich, Jun He, Thomas Jansen, Alberto Moraglio:
Genetic and Evolutionary Computation. 1-2
- Benjamin Doerr, Marvin Künnemann:
Optimizing linear functions with the (1+λ) evolutionary algorithm - Different asymptotic runtimes for different instances. 3-23 - Anh Quang Nguyen, Andrew M. Sutton, Frank Neumann:
Population size matters: Rigorous runtime results for maximizing the hypervolume indicator. 24-36 - Pietro S. Oliveto, Christine Zarges:
Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change. 37-56 - Manuel Schmitt, Rolf Wanka:
Particle swarm optimization almost surely finds local optima. 57-72 - Andrei Lissovoi, Carsten Witt:
Runtime analysis of ant colony optimization on dynamic shortest path problems. 73-85
Volume 561, Part B, January 2015
Preface
- Michel Raynal, Franck Petit:
Special Issue on Distributed Computing and Networking. 87
- Yehuda Afek, Eli Gafni:
A simple characterization of asynchronous computations. 88-95 - Seda Davtyan, Kishori M. Konwar, Alexander Russell, Alexander A. Shvartsman:
Dealing with undependable workers in decentralized network supercomputing. 96-112 - Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan, Eli Upfal:
Fast distributed PageRank computation. 113-121 - Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Sergio Rajsbaum:
Linear space bootstrap communication schemes. 122-133 - Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan:
Sublinear bounds for randomized leader election. 134-143
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.