Sciweavers

526 search results - page 42 / 106
» Type Abstractions of Name-Passing Processes
Sort
View
PDPTA
2007
13 years 10 months ago
Communication with Super Flexible Messaging
Abstract Super Flexible Messaging (SFM) provides a powerful and elegant message passing abstraction for transferring arbitrary data between remote processes. SFM achieves the simpl...
Alexey Fedosov, Gregory Benson
IJMMS
2008
90views more  IJMMS 2008»
13 years 8 months ago
Pair programming and the mysterious role of the navigator
Computer programming is generally understood to be highly challenging and since its inception a wide range of approaches, tools and methodologies have been developed to assist in ...
Sallyann Bryant, Pablo Romero, Benedict du Boulay
INTERNET
2006
119views more  INTERNET 2006»
13 years 8 months ago
Toward a Grid-Based DBMS
level is a grid abstract machine, which consists of a collection of typed nodes -- data nodes (purple), director nodes (red), management nodes (orange), and various processing node...
Craig W. Thompson
BMCBI
2011
13 years 7 days ago
Assessing the functional coherence of modules found in multiple-evidence networks from Arabidopsis
Background: Combining multiple evidence-types from different information sources has the potential to reveal new relationships in biological systems. The integrated information ca...
Artem Lysenko, Michael Defoin-Platel, Keywan Hassa...
PLDI
2012
ACM
11 years 11 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa