Sciweavers

1055 search results - page 45 / 211
» Enumerations in computable structure theory
Sort
View
DNIS
2005
Springer
112views Database» more  DNIS 2005»
14 years 3 months ago
Modelling Peer-to-Peer Data Networks Under Complex System Theory
: A Peer-to-peer Data Network (PDN) is an open and evolving society of peer nodes that assemble into a network to share their data for mutual benefit. PDNs are enabled by distribu...
Cyrus Shahabi, Farnoush Banaei Kashani
PODC
2009
ACM
14 years 10 months ago
Correctness of gossip-based membership under message loss
Due to their simplicity and effectiveness, gossip-based membership protocols have become the method of choice for maintaining partial membership in large P2P systems. A variety of...
Maxim Gurevich, Idit Keidar
CF
2008
ACM
14 years 3 days ago
Exact combinational logic synthesis and non-standard circuit design
Using a new exact synthesizer that automatically induces minimal universal boolean function libraries, we introduce two indicators for comparing their expressiveness: the first ba...
Paul Tarau, Brenda Luderman
DCC
2011
IEEE
13 years 5 months ago
The cocyclic Hadamard matrices of order less than 40
In this paper all cocyclic Hadamard matrices of order less than 40 are classified. That is, all such Hadamard matrices are explicitly constructed, up to Hadamard equivalence. Thi...
Padraig Ó Catháin, Marc Röder
BICOB
2010
Springer
14 years 2 months ago
Algebraic Theory of DNA Recombination
In this paper we investigate the structure and representation of n-ary algebras arising from DNA recombination, where n is a number of DNA segments participating in recombination. ...
Sergei R. Sverchkov