Sciweavers

3378 search results - page 63 / 676
» A universe of binding and computation
Sort
View
FOCS
1996
IEEE
15 years 1 months ago
Universal Stability Results for Greedy Contention-Resolution Protocols
In this paper, we analyze the behavior of communication networks in which packets are generated dynamically at the nodes and routed in discrete time steps across the edges. We foc...
Matthew Andrews, Baruch Awerbuch, Antonio Fern&aac...
JLP
2007
89views more  JLP 2007»
14 years 9 months ago
Universality and semicomputability for nondeterministic programming languages over abstract algebras
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
Wei Jiang, Yuan Wang, Jeffery I. Zucker
ALGOSENSORS
2007
Springer
15 years 4 months ago
Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
Anirvan DuttaGupta, Arijit Bishnu, Indranil Sengup...
CORR
2008
Springer
94views Education» more  CORR 2008»
14 years 11 months ago
Small Turing universal signal machines
geometrical computation 4: small Turing universal signal machines J
Jérôme Durand-Lose
IPL
2000
74views more  IPL 2000»
14 years 9 months ago
A new universal and fault-tolerant quantum basis
A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environ...
P. Oscar Boykin, Tal Mor, Matthew Pulver, Vwani P....