Sciweavers

1112 search results - page 178 / 223
» Executing Abstract Test Cases
Sort
View
SIROCCO
2000
14 years 11 months ago
Cooperative computing with fragmentable and mergeable groups
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
Chryssis Georgiou, Alexander A. Shvartsman
TCOM
2008
74views more  TCOM 2008»
14 years 10 months ago
Stability of a frame-based oldest-cell-first maximal weight matching algorithm
Abstract-- Input-queued cell switches employing the oldestcell-first (OCF) policy have been shown to yield low mean delay characteristics. Moreover, it has been proven that OCF is ...
Xike Li, Itamar Elhanany
IFIP
2010
Springer
14 years 8 months ago
Service Migration Protocol for NFC Links
Abstract. In future ubiquitous communication environments, users expect to move freely while continuously interacting with the available applications through a variety of devices. ...
Anders Nickelsen, Miquel Martin, Hans-Peter Schwef...
WRLA
2010
14 years 8 months ago
A Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories
For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E m...
Francisco Durán, José Meseguer
EMSOFT
2010
Springer
14 years 8 months ago
Nucleos: a runtime system for ultra-compact wireless sensor nodes
Nucleos is a new runtime system for ultra-lightweight embedded systems. Central to Nucleos is a dispatcher based on the concept of e threaded code, which enables layers of abstrac...
Jiwon Hahn, Pai H. Chou