Sciweavers

1321 search results - page 155 / 265
» Logic Simulation Using Networks of State Machines
Sort
View
DSN
2007
IEEE
15 years 4 months ago
How to Choose a Timing Model?
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
Idit Keidar, Alexander Shraer
DSN
2005
IEEE
15 years 3 months ago
Fast Byzantine Consensus
— We present the first protocol that reaches asynchronous Byzantine consensus in two communication steps in the common case. We prove that our protocol is optimal in terms of bo...
Jean-Philippe Martin, Lorenzo Alvisi
HICSS
2002
IEEE
93views Biometrics» more  HICSS 2002»
15 years 2 months ago
High-Level Executable Specification of the Universal Plug and Play Architecture
Recently, Microsoft took a lead in the development of a standard for peer-to-peer network connectivity of various intelligent appliances, wireless devices and PCs. It is called th...
Uwe Glässer, Yuri Gurevich, Margus Veanes
DSN
2004
IEEE
15 years 1 months ago
Efficient Byzantine-Tolerant Erasure-Coded Storage
This paper describes a decentralized consistency protocol for survivable storage that exploits local data versioning within each storage-node. Such versioning enables the protocol...
Garth R. Goodson, Jay J. Wylie, Gregory R. Ganger,...
NN
2002
Springer
115views Neural Networks» more  NN 2002»
14 years 9 months ago
A self-organising network that grows when required
The ability to grow extra nodes is a potentially useful facility for a self-organising neural network. A network that can add nodes into its map space can approximate the input sp...
Stephen Marsland, Jonathan Shapiro, Ulrich Nehmzow