Sciweavers

710 search results - page 111 / 142
» Relational Expressive Power of Constraint Query Languages
Sort
View
JCB
2007
136views more  JCB 2007»
13 years 7 months ago
A Structure-Based Flexible Search Method for Motifs in RNA
The discovery of non-coding RNA (ncRNA) motifs and their role in regulating gene expression has recently attracted considerable attention. The goal is to discover these motifs in ...
Isana Veksler-Lublinsky, Michal Ziv-Ukelson, Danny...
CP
2007
Springer
14 years 1 months ago
Solving the Salinity Control Problem in a Potable Water System
Salinity is the relative concentration of salts in water. In a city of southern China, the local water supply company pumps water from a nearby river for potable use. During the wi...
Chiu Wo Choi, Jimmy Ho-Man Lee
PLANX
2007
13 years 9 months ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Pierre Genevès, Nabil Layaïda, Alan Sc...
EELC
2006
124views Languages» more  EELC 2006»
13 years 11 months ago
How Grammar Emerges to Dampen Combinatorial Search in Parsing
Abstract. According to the functional approach to language evolution (inspired by cognitive linguistics and construction grammar), grammar arises to deal with issues in communicati...
Luc Steels, Pieter Wellens
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
13 years 11 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein