Sciweavers

3653 search results - page 388 / 731
» On Recognizable Timed Languages
Sort
View
FUIN
2007
138views more  FUIN 2007»
15 years 6 months ago
Parsing Expression Grammar as a Primitive Recursive-Descent Parser with Backtracking
Two recent developments in the field of formal languages are Parsing Expression Grammar (PEG) and packrat parsing. The PEG formalism is similar to BNF, but defines syntax in ter...
Roman R. Redziejowski
ACTA
2002
108views more  ACTA 2002»
15 years 6 months ago
Object type constructors
Object type constructors have been introduced as an approach to adding container object types to a language with type inference. Useful subtyping for object type constructors requ...
Dominic Duggan
ACTAC
2002
75views more  ACTAC 2002»
15 years 6 months ago
Framework for Studying Substitution
This paper describes a framework for handling bound variable renaming and substitution mathematically rigorously with the aim at the same time to stay as close as possible to huma...
Härmel Nestra
JUCS
2002
89views more  JUCS 2002»
15 years 6 months ago
Scheduling Tasks to a Team of Autonomous Mobile Service Robots in Indoor Enviroments
Abstract: This paper presents a complete system for scheduling transportation orders to a fleet of autonomous mobile robots in service environments. It consists of the autonomous m...
Hartmut Surmann, Antonio Morales
ML
2002
ACM
223views Machine Learning» more  ML 2002»
15 years 6 months ago
Text Categorization with Support Vector Machines. How to Represent Texts in Input Space?
The choice of the kernel function is crucial to most applications of support vector machines. In this paper, however, we show that in the case of text classification, term-frequenc...
Edda Leopold, Jörg Kindermann