264 search results - page 47 / 53 » Regular Mesh Construction Algorithms using Regular Handles |
156
click to vote
CAV
2001
Springer
15 years 10 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...
283
Voted
POPL
2004
ACM
16 years 6 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...
159
click to vote
HPCC
2007
Springer
15 years 12 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...
155
Voted
ICLP
2005
Springer
15 years 11 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...
162
Voted
ML
2000
ACM
15 years 5 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 ...