• 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 18 matches

• 2009
• 
  Ei Ando, Hirotaka Ono, Masafumi Yamashita:
  A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems. SAGA 2009: 89-103
• 
  Andrea Arcuri:
  Theoretical Analysis of Local Search in Software Testing. SAGA 2009: 156-168
• 
  Yakir Berchenko, Mina Teicher:
  Graph Embedding through Random Walk for Shortest Paths Problems. SAGA 2009: 127-140
• 
  Robert Berke, Mikael Onsjö:
  Propagation Connectivity of Random Hypergraphs. SAGA 2009: 117-126
• 
  Mikhail Dashevskiy, Zhiyuan Luo:
  Prediction of Long-Range Dependent Time Series Data with Performance Guarantee. SAGA 2009: 31-45
• 
  Boris Defourny, Damien Ernst, Louis Wehenkel:
  Bounds for Multistage Stochastic Programs Using Supervised Learning Strategies. SAGA 2009: 61-73
• 
  Dimitrios I. Diochnos, György Turán:
  On Evolvability: The Swapping Algorithm, Product Distributions, and Covariance. SAGA 2009: 74-88
• 
  Matthias Englert, Berthold Vöcking, Melanie Winkler:
  Economical Caching with Stochastic Prices. SAGA 2009: 179-190
• 
  C. Grills, D. A. Fennell, S. F. C. Shearer:
  Markov Modelling of Mitochondrial BAK Activation Kinetics during Apoptosis. SAGA 2009: 191-205
• 
  Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi:
  Bipartite Graph Representation of Multiple Decision Table Classifiers. SAGA 2009: 46-60
• 
  Charles Jordan, Thomas Zeugmann:
  Relational Properties Expressible with One Universal Quantifier Are Testable. SAGA 2009: 141-155
• 
  Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
  How to Design a Linear Cover Time Random Walk on a Finite Graph. SAGA 2009: 104-116
• 
  Werner Römisch:
  Scenario Reduction Techniques in Stochastic Programming. SAGA 2009: 1-14
• 
  Taisuke Sato:
  Statistical Learning of Probabilistic BDDs. SAGA 2009: 15
• 
  S. F. C. Shearer, S. Sahoo, A. Sahoo:
  Stochastic Dynamics of Logistic Tumor Growth. SAGA 2009: 206-220
• 
  Vladimir V. V'yugin:
  Learning Volatility of Discrete Time Series Using Prediction with Expert Advice. SAGA 2009: 16-30
• 
  Xin-She Yang:
  Firefly Algorithms for Multimodal Optimization. SAGA 2009: 169-178
• 
  Osamu Watanabe, Thomas Zeugmann:
  Stochastic Algorithms: Foundations and Applications, 5th International Symposium, SAGA 2009, Sapporo, Japan, October 26-28, 2009. Proceedings. Lecture Notes in Computer Science 5792, Springer 2009, ISBN 978-3-642-04943-9 [contents]