Sciweavers

774 search results - page 119 / 155
» Markov incremental constructions
Sort
View
IPPS
1997
IEEE
14 years 1 months ago
On the Dynamic Initialization of Parallel Computers
Abstract. The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to ...
Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya
DBPL
1993
Springer
104views Database» more  DBPL 1993»
14 years 1 months ago
Extensible Grammars for Language Specialization
A frequent dilemma in the design of a database programming language is the choice between a language with a rich set of tailored notations for schema definitions, query expression...
Luca Cardelli, Florian Matthes, Martín Abad...
ECOOP
1993
Springer
14 years 1 months ago
Nested Mixin-Methods in Agora
: Mixin-based inheritance is an inheritance technique that has been shown to subsume a variety of different inheritance mechanisms. It is based directly upon an incremental modific...
Patrick Steyaert, Wim Codenie, Theo D'Hondt, Koen ...
SPAA
1990
ACM
14 years 1 months ago
Parallel Algorithms for Arrangements
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
Richard J. Anderson, Paul Beame, Erik Brisson
APSEC
2007
IEEE
14 years 1 months ago
Definition of an Executable SPEM 2.0
One major advantage of executable models is that once constructed, they can be run, checked, validated and improved in short incremental and iterative cycles. In the field of Soft...
Reda Bendraou, Benoît Combemale, Xavier Cr&e...