Sciweavers

1916 search results - page 356 / 384
» Reconfiguring a state machine
Sort
View
MOBISYS
2005
ACM
16 years 1 days ago
A dynamic operating system for sensor nodes
Sensor network nodes exhibit characteristics of both embedded systems and general-purpose systems. They must use little energy and be robust to environmental conditions, while als...
Chih-Chieh Han, Ram Kumar, Roy Shea, Eddie Kohler,...
DCC
2006
IEEE
16 years 1 days ago
The B-coder: An Improved Binary Arithmetic Coder and Probability Estimator
In this paper we present the B-coder, an efficient binary arithmetic coder that performs extremely well on a wide range of data. The B-coder should be classed as an `approximate&#...
Benjamin Kelly, David F. Brailsford
101
Voted
POPL
2010
ACM
15 years 9 months ago
On the Verification Problem for Weak Memory Models
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
Ahmed Bouajjani, Madanlal Musuvathi, Mohamed Faouz...
106
Voted
ICWS
2009
IEEE
15 years 9 months ago
Wrap Scientific Applications as WSRF Grid Services Using gRAVI
— Web service models are increasingly being used in the Grid community as way to create distributed applications exposing data and/or applications through self describing interfa...
Kyle Chard, Wei Tan, Joshua Boverhof, Ravi K. Madd...
87
Voted
EUROSYS
2010
ACM
15 years 9 months ago
The Next 700 BFT Protocols
Modern Byzantine fault-tolerant state machine replication (BFT) protocols involve about 20.000 lines of challenging C++ code encompassing synchronization, networking and cryptogra...
Rachid Guerraoui, Nikola Knezevic, Vivien Quéma, ...