Sciweavers

104 search results - page 15 / 21
» Tree Automata with Global Constraints
Sort
View
COLING
1992
13 years 8 months ago
Modularity, Parallelism, And Licensing In A Principle-Based Parser For German
This paper presents a direct implementation of Government-Binding theory in a parser for German, which faithfully models the modular structure of the theory. The modular design yi...
Sebastian Millies
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 7 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
CPAIOR
2005
Springer
14 years 1 months ago
Computing Explanations for the Unary Resource Constraint
Integration of explanations into a CSP solver is a technique addressing difficult question “why my problem has no solution”. Moreover, explanations together with advanced searc...
Petr Vilím
COMPSAC
2009
IEEE
14 years 2 months ago
System Safety Requirements as Control Structures
Along with the popularity of software-intensive systems, the interactions between system components and between humans and software applications are becoming more and more complex...
Zhe Chen, Gilles Motet
ATAL
2009
Springer
14 years 2 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...