264 search results - page 47 / 53 » Regular Mesh Construction Algorithms using Regular Handles |
66
Voted
CAV
2001
Springer
15 years 2 months ago
2001
Springer
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
182
click to vote
POPL
2004
ACM
15 years 10 months ago
2004
ACM
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
HPCC
2007
Springer
15 years 3 months ago
2007
Springer
The OTIS-Network (also referred to as two-level swapped network) is composed of n clones of an n-node original network constituting its clusters. It has received much attention due...
ICLP
2005
Springer
15 years 3 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
ML
2000
ACM
14 years 9 months ago
2000
ACM
This paper discusses a novel distributed adaptive algorithm and representation used to construct populations of adaptive Web agents. These InfoSpiders browse networked information ...