Sciweavers

4666 search results - page 131 / 934
» Equations on Timed Languages
Sort
View
ACL
1998
15 years 6 months ago
Restrictions on Tree Adjoining Languages
Several methods are known for parsing languages generated by Tree Adjoining Grammars (TAGs) in O(n 6) worst case running time. In this paper we investigate which restrictions on T...
Giorgio Satta, William Schuler
COLING
1992
15 years 6 months ago
On Representing the Temporal Structure of a Natural Language Text
A proposal to deal with tenses in the framework of Discourse Representation Theory is presented, ms it has been implemented for a fragment at the IMS for the project LILOG. It is ...
Kurt Eberle
ICOIN
2003
Springer
15 years 10 months ago
ATFRC: Adaptive TCP Friendly Rate Control Protocol
Abstract. TFRC (TCP Friendly Rate Control) is a rate-based congestion control protocol for non-TCP flows. TFRC controls the sending rate by using the TCP throughput equation consi...
Seongho Cho, Heekyoung Woo, Jongwon Lee
AGP
1999
IEEE
15 years 9 months ago
ACI1 constraints
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
Agostino Dovier, Carla Piazza, Enrico Pontelli, Gi...
CP
2008
Springer
15 years 7 months ago
Exploiting Common Subexpressions in Numerical CSPs
It is acknowledged that the symbolic form of the equations is crucial for interval-based solving techniques to efficiently handle systems of equations over the reals. However, only...
Ignacio Araya, Bertrand Neveu, Gilles Trombettoni