749 search results - page 127 / 150 » Combinatory Models and Symbolic Computation |
105
click to vote
SMA
2009
ACM
15 years 4 months ago
2009
ACM
In this paper, we describe an algorithm for generating an exact rational envelope of a two-parameter family of spheres given by a quadratic patch in R3,1 , which is considered as ...
FSTTCS
2005
Springer
15 years 3 months ago
2005
Springer
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...
CP
1997
Springer
15 years 2 months ago
1997
Springer
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
ICALP
1990
Springer
15 years 2 months ago
1990
Springer
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
DBPL
2007
Springer
15 years 1 months ago
2007
Springer
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...