2343 search results - page 180 / 469 » Structure and Interpretation of Computer Programs |
173
click to vote
ICML
2005
IEEE
16 years 6 months ago
2005
IEEE
Markov logic networks (MLNs) combine logic and probability by attaching weights to first-order clauses, and viewing these as templates for features of Markov networks. In this pap...
133
click to vote
FDL
2007
IEEE
16 years 11 days ago
2007
IEEE
In this paper, we compare the underlying models of computation of the system description languages SystemC and Esterel. Although these languages have a rather different origin, we...
174
click to vote
BPM
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a ...
155
click to vote
FOSSACS
2010
Springer
16 years 26 days ago
2010
Springer
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
166
click to vote
FPCA
1995
15 years 9 months ago
1995
Models of Memory Management Greg Morrisett Matthias Felleisen Robert Harper January 1995 CMU{CS{95{110 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Al...