Sciweavers

1089 search results - page 36 / 218
» Randomness and Reducibility
Sort
View
TIT
2010
113views Education» more  TIT 2010»
13 years 3 months ago
Asynchronous CDMA systems with random spreading-part II: design criteria
Totally asynchronous code-division multiple-access (CDMA) systems are addressed. In part I, the fundamental limits of asynchronous CDMA systems were analyzed in terms of total cap...
Laura Cottatellucci, Ralf R. Müller, Mé...
APAL
2010
125views more  APAL 2010»
13 years 9 months ago
The computable Lipschitz degrees of computably enumerable sets are not dense
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
Adam R. Day
ARC
2008
Springer
87views Hardware» more  ARC 2008»
13 years 11 months ago
Online Hardware Task Scheduling and Placement Algorithm on Partially Reconfigurable Devices
In this paper, we propose an online hardware task scheduling and placement algorithm and evaluate it performance. Experimental results on large random task set show that our algori...
Thomas Marconi, Yi Lu 0004, Koen Bertels, Georgi G...
GLVLSI
2010
IEEE
189views VLSI» more  GLVLSI 2010»
14 years 2 months ago
8Gb/s capacitive low power and high speed 4-PWAM transceiver design
In this paper, capacitive 4-PWAM transmitter architectures and circuits are proposed and its performances are analyzed with random jitter and PVT variation comparing with other wo...
Young Bok Kim, Yong-Bin Kim, Fabrizio Lombardi
ICSE
2008
IEEE-ACM
14 years 9 months ago
ARTOO: adaptive random testing for object-oriented software
Intuition is often not a good guide to know which testing strategies will work best. There is no substitute for experimental analysis based on objective criteria: how many bugs a ...
Ilinca Ciupa, Andreas Leitner, Manuel Oriol, Bertr...