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

• 1995
• 
  Andreas Alexander Albrecht:
  On Lower Bounds for the Depth of Threshold Circuits with Weights from {-1, 0, +1}. GOSLER Final Report 1995: 404-416
• 
  Andris Ambainis:
  Optimization Problem in Inductive Inference. GOSLER Final Report 1995: 96-107
• 
  Kalvis Apsitis:
  Topological Considerations in Composing Teams of Learning Machines. GOSLER Final Report 1995: 146-154
• 
  Hans-Rainer Beick, Ventsislav Stankov:
  GolerP - A Logic Programming Tool for Inductive Inference. GOSLER Final Report 1995: 482-510
• 
  John Case, Mandayam Suraj, Sanjay Jain:
  Not-So-Nearly-Minimal-Size Program Inference. GOSLER Final Report 1995: 76-95
• 
  Robert P. Daley, Bala Kalyanasundaram:
  Towards Reduction Argumentf for FINite Learning. GOSLER Final Report 1995: 63-75
• 
  Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
  Probabilistic versus Deterministic Memory Limited Learning. GOSLER Final Report 1995: 155-161
• 
  Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
  Error Detecting in Inductive Inference. GOSLER Final Report 1995: 25-48
• 
  Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
  Learning from Good Examples. GOSLER Final Report 1995: 49-62
• 
  William I. Gasarch, Mark G. Pleszkoch, Mahendran Velauthapillai:
  Classification Using Information. GOSLER Final Report 1995: 162-173
• 
  Christoph Globig, Stefan Wess:
  Learning in Case-Based Classification Algorithms. GOSLER Final Report 1995: 340-362
• 
  Ulf Goldammer:
  Inductive Synthesis of Rewrite Programs. GOSLER Final Report 1995: 435-466
• 
  Gunter Grieser:
  T_LP^S - a Term Rewriting Laboratory (not only) for Experiments in Automatic Program Synthesis. GOSLER Final Report 1995: 467-481
• 
  Sanjay Jain, Arun Sharma:
  On Identification by Teams and Probabilistic Machines. GOSLER Final Report 1995: 108-145
• 
  Gerhard Mehlsam, Hermann Kaindl, Wilhelm Barth:
  Feature Construction during Tree Learning. GOSLER Final Report 1995: 391-403
• 
  Eberhard Pippig:
  Structuring Neural Networks and PAC-Learning. GOSLER Final Report 1995: 417-434
• 
  Christian Posthoff, Michael Schlosser:
  Optimal Strategies - Learning from Examples - Boolean Equations. GOSLER Final Report 1995: 363-390
• 
  Takeshi Shinohara, Setsuo Arikawa:
  Pattern Inference. GOSLER Final Report 1995: 259-291
• 
  Yuji Takada:
  Learning Formal Languages Based on Control Sets. GOSLER Final Report 1995: 316-339
• 
  Phil Watson:
  Inductive Learning of Recurrence-Term Languages from Positive Data. GOSLER Final Report 1995: 292-315
• 
  Rolf Wiehagen, Carl H. Smith, Thomas Zeugmann:
  Classifying Recursive Predicates and Languages. GOSLER Final Report 1995: 174-189
• 
  Rolf Wiehagen, Thomas Zeugmann:
  Learning and Consistency. GOSLER Final Report 1995: 1-24
• 
  Thomas Zeugmann, Steffen Lange:
  A Guided Tour Across the Boundaries of Learning Recursive Languages. GOSLER Final Report 1995: 190-258
• 
  Klaus P. Jantke, Steffen Lange:
  Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report. Lecture Notes in Computer Science 961, Springer 1995, ISBN 3-540-60217-8 [contents]