• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 16 matches

• 2019
• 
  Frank Neumann, Andrew M. Sutton:
  Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem. FOGA 2019: 147-153
• 
  Feng Shi, Frank Neumann, Jianxin Wang:
  Runtime analysis of evolutionary algorithms for the depth restricted (1, 2)-minimum spanning tree problem. FOGA 2019: 133-146
• 
  Denis Antipov, Benjamin Doerr, Vitalii Karavaev:
  A tight runtime analysis for the (1 + (λ, λ)) GA on leadingones. FOGA 2019: 169-182
• 
  Jakob Bossek, Pascal Kerschke, Aneta Neumann, Markus Wagner, Frank Neumann, Heike Trautmann:
  Evolving diverse TSP instances by means of novel and creative mutation operators. FOGA 2019: 58-71
• 
  Jakob Bossek, Dirk Sudholt:
  Time complexity analysis of RLS and (1 + 1) EA for the edge coloring problem. FOGA 2019: 102-115
• 
  Bilel Derbel, Arnaud Liefooghe, Sébastien Vérel, Hernán E. Aguirre, Kiyoshi Tanaka:
  New features for continuous exploratory landscape analysis based on the SOO tree. FOGA 2019: 72-86
• 
  Benjamin Doerr:
  An exponential lower bound for the runtime of the compact genetic algorithm on jump functions. FOGA 2019: 25-33
• 
  Hsien-Kuei Hwang, Carsten Witt:
  Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools. FOGA 2019: 1-12
• 
  Vasil Khalidov, Maxime Oquab, Jérémy Rapin, Olivier Teytaud:
  Consistent population control: generate plenty of points, but with a bit of resampling. FOGA 2019: 116-123
• 
  Per Kristian Lehre, Phan Trung Hai Nguyen:
  On the limitations of the univariate marginal distribution algorithm to deception and where bivariate EDAs might help. FOGA 2019: 154-168
• 
  Johannes Lengler, Xun Zou:
  Exponential slowdown for larger populations: the (µ + 1)-EA on monotone functions. FOGA 2019: 87-101
• 
  Daiki Morinaga, Youhei Akimoto:
  Generalized drift analysis in continuous domain: linear convergence of (1 + 1)-ES on strongly convex functions with Lipschitz continuous gradients. FOGA 2019: 13-24
• 
  Vahid Roostapour, Mojgan Pourhassan, Frank Neumann:
  Analysis of baseline evolutionary algorithms for the packing while travelling problem. FOGA 2019: 124-132
• 
  Jonathan E. Rowe, Aishwaryaprajna:
  The benefits and limitations of voting mechanisms in evolutionary optimisation. FOGA 2019: 34-42
• 
  Patrick Spettel, Hans-Georg Beyer, Michael Hellwig:
  Steady state analysis of a multi-recombinative meta-ES on a conically constrained problem with comparison to σSA and CSA. FOGA 2019: 43-57
• 
  Tobias Friedrich, Carola Doerr, Dirk V. Arnold:
  Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, FOGA 2019, Potsdam, Germany, August 27-29, 2019. ACM 2019, ISBN 978-1-4503-6254-2 [contents]