Sciweavers

835 search results - page 47 / 167
» Structural Recursion as a Query Language
Sort
View
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
13 years 10 months ago
Genetic programming with polymorphic types and higher-order functions
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
Franck Binard, Amy P. Felty
NLPRS
2001
Springer
14 years 1 months ago
Sentence Extraction by Questioning
This paper presents a sentence extraction method based on Concept Coupling Model, a language model for handling natural language sentence structures. Sentence extraction is perfor...
Zenshiro Kawasaki, Keiji Shibata, Masato Tajima
ICFP
2005
ACM
14 years 8 months ago
Scrap your boilerplate with class: extensible generic functions
The `Scrap your boilerplate' approach to generic programming allows the programmer to write generic functions that can traverse arbitrary data structures, and yet have type-s...
Ralf Lämmel, Simon L. Peyton Jones
ICDE
2001
IEEE
106views Database» more  ICDE 2001»
14 years 10 months ago
Querying XML Documents Made Easy: Nearest Concept Queries
Due to the ubiquity and popularity of XML, users often are in the following situation: they want to query XML documents which contain potentially interesting information but they ...
Albrecht Schmidt 0002, Martin L. Kersten, Menzo Wi...
AAAI
2008
13 years 10 months ago
Querying Sequential and Concurrent Horn Transaction Logic Programs Using Tabling Techniques
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
Paul Fodor