Sciweavers

1855 search results - page 146 / 371
» A coding theorem for distributed computation
Sort
View
ACCESSNETS
2009
Springer
15 years 1 months ago
Capacity of Two-Way Relay Channel
This paper investigates the capacity of a wireless two-way relay channel in which two end nodes exchange information via a relay node. The capacity is defined in the information-th...
Shengli Zhang, Soung Chang Liew, Hui Wang, Xiao-Hu...
IJCAI
1997
15 years 4 months ago
Combining Probabilistic Population Codes
We study the problemof statisticallycorrect inference in networks whose basic representations are population codes. Population codes are ubiquitous in the brain, and involve the s...
Richard S. Zemel, Peter Dayan
124
Voted
ISORC
2005
IEEE
15 years 9 months ago
Proof Slicing with Application to Model Checking Web Services
Web Services emerge as a new paradigm for distributed computing. Model checking is an important verification method to ensure the trustworthiness of composite WS. abstraction and...
Hai Huang, Wei-Tek Tsai, Raymond A. Paul
124
Voted
CORR
2000
Springer
91views Education» more  CORR 2000»
15 years 3 months ago
Algorithmic Theories of Everything
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
Jürgen Schmidhuber
118
Voted
AINA
2010
IEEE
15 years 8 months ago
Consensus in Anonymous Distributed Systems: Is There a Weakest Failure Detector?
: This paper is on failure detectors to solve the consensus problem in asynchronous systems made up of anonymous processes prone to crash and connected by asynchronous reliable cha...
François Bonnet, Michel Raynal