3220 search results - page 438 / 644 » Constrained Graph Processes |
174
click to vote
APN
2006
Springer
15 years 10 months ago
2006
Springer
A netchart is basically a Petri net whose places are located at some process and whose transitions are labeled by message sequence charts (MSCs). Two recent papers showed independe...
166
click to vote
AFP
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. These notes discuss the simultaneous use of generalised fold operators and monads to structure functional programs. Generalised fold operators structure programs after th...
173
click to vote
NIPS
2001
15 years 7 months ago
2001
We present an algorithm that induces a class of models with thin junction trees--models that are characterized by an upper bound on the size of the maximal cliques of their triang...
169
click to vote
FTCS
1998
15 years 7 months ago
1998
The traditional use of formal methods has been for the veri cation of algorithms or protocols. Given the high cost and limitations in state space coverage provided by conventional...
153
click to vote
ISMB
1997
15 years 7 months ago
1997
Seq7 is a newprogramfor generating multiple structure-based alignments of RNAsequences. Byusing a variant of Dijkstra’s algorithm to find the shortest path through a specially c...