Sciweavers

1671 search results - page 226 / 335
» Language Constructs for Multi-agent Programming
Sort
View
PSC
1992
15 years 10 months ago
A Message Passing Implementation of Lazy Task Creation
Abstract. This paper describes an implementation technique for Multilisp's future construct aimed at large shared-memory multiprocessors. The technique is a variant of lazy ta...
Marc Feeley
ICALP
2000
Springer
15 years 10 months ago
Temporal Rewards for Performance Evaluation
Today many formalisms exist for specifying complex Markov chains. In contrast, formalism for specifying the quantitative properties to analyze have remained quite primitive. In th...
Jeroen Voeten
ICALP
1995
Springer
15 years 10 months ago
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
Hans L. Bodlaender, Torben Hagerup
MPC
1995
Springer
116views Mathematics» more  MPC 1995»
15 years 9 months ago
Computer-Aided Computing
PVS is a highly automated framework for speci cation and veri cation. We show how the language and deduction features of PVS can be used to formalize, mechanize, and apply some us...
Natarajan Shankar
TLCA
1995
Springer
15 years 9 months ago
Typed Operational Semantics
operator abstraction is a language construct relevant to object oriented programming languages and to ML2000, the successor to Standard ML. In this paper, we introduce Fω ≤, a ...
Healfdene Goguen