Sciweavers

118 search results - page 13 / 24
» Deterministic and Probabilistic Implementation of Context
Sort
View
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 2 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
IEEEHPCS
2010
13 years 6 months ago
3-SAT on CUDA: Towards a massively parallel SAT solver
This work presents the design and implementation of a massively parallel 3-SAT solver, specifically targeting random problem instances. Our approach is deterministic and features ...
Quirin Meyer, Fabian Schonfeld, Marc Stamminger, R...
JSAC
2008
98views more  JSAC 2008»
13 years 7 months ago
Randomized consensus algorithms over large scale networks
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
Fabio Fagnani, Sandro Zampieri
PAAPP
2007
115views more  PAAPP 2007»
13 years 7 months ago
Quantum computing: beyond the limits of conventional computation
The quantum model of computation not only o ers entirely new ways to manipulate information, but also allows information processing tasks to be formulated in unconventional, genui...
Marius Nagy, Selim G. Akl
FUIN
2008
119views more  FUIN 2008»
13 years 7 months ago
Modeling Communication with Synchronized Environments
A deterministic behavior of systems composed of several modules is a desirable design goal. Assembling a complex system from components requires also a high degree of re-usability....
Tiberiu Seceleanu, Axel Jantsch