Sciweavers

995 search results - page 14 / 199
» Wire-speed total order
Sort
View
RECOMB
2009
Springer
14 years 3 months ago
Pseudo Boolean Programming for Partially Ordered Genomes
Comparing genomes of different species is a crucial problem in comparative genomics. Different measures have been proposed to compare two genomes: number of common intervals, num...
Sébastien Angibaud, Guillaume Fertin, Annel...
CPC
1999
105views more  CPC 1999»
13 years 8 months ago
Total Path Length For Random Recursive Trees
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
Robert P. Dobrow, James Allen Fill
HOTI
2008
IEEE
14 years 3 months ago
Network Processing on an SPE Core in Cell Broadband Engine
Cell Broadband EngineTM is a multi-core system on a chip and is composed of a general-purpose Power Processing Element (PPE) and eight Synergistic Processing Elements (SPEs). Its ...
Yuji Kawamura, Takeshi Yamazaki, Hiroshi Kyusojin,...
WIS
2004
13 years 10 months ago
Ordering in Mobile Networks Using Integrated Sequencers
Distributed applications mostly interact by exchanging messages. For this purpose the messages often need to be ordered. Since today more and more mobile devices are used message o...
Sven Bittner
CORR
2002
Springer
131views Education» more  CORR 2002»
13 years 8 months ago
Logic Programming with Ordered Disjunction
Abstract. Logic Programming paradigms that allow for expressing preferences have drawn a lot of research interest over the last years. Among them, the principle of ordered disjunct...
Gerhard Brewka