Results 1  10
of
4,786
Cognitive Radio: BrainEmpowered Wireless Communications
, 2005
"... Cognitive radio is viewed as a novel approach for improving the utilization of a precious natural resource: the radio electromagnetic spectrum. The cognitive radio, built on a softwaredefined radio, is defined as an intelligent wireless communication system that is aware of its environment and use ..."
Abstract

Cited by 1479 (4 self)
 Add to MetaCart
Cognitive radio is viewed as a novel approach for improving the utilization of a precious natural resource: the radio electromagnetic spectrum. The cognitive radio, built on a softwaredefined radio, is defined as an intelligent wireless communication system that is aware of its environment and uses the methodology of understandingbybuilding to learn from the environment and adapt to statistical variations in the input stimuli, with two primary objectives in mind: • highly reliable communication whenever and wherever needed; • efficient utilization of the radio spectrum. Following the discussion of interference temperature as a new metric for the quantification and management of interference, the paper addresses three fundamental cognitive tasks. 1) Radioscene analysis. 2) Channelstate estimation and predictive modeling. 3) Transmitpower control and dynamic spectrum management. This paper also discusses the emergent behavior of cognitive radio.
Field Experiments
 Journal of Economic Literature Vol XLII
, 2004
"... Experimental economists are leaving the reservation. They are recruiting subjects in the field rather than in the classroom, using field goods rather than induced valuations, and using field context rather than abstract terminology in instructions. We argue that there is something methodologically f ..."
Abstract

Cited by 398 (70 self)
 Add to MetaCart
Experimental economists are leaving the reservation. They are recruiting subjects in the field rather than in the classroom, using field goods rather than induced valuations, and using field context rather than abstract terminology in instructions. We argue that there is something methodologically fundamental behind this trend. Field experiments differ from laboratory experiments in many ways. Although it is tempting to view field experiments as simply less controlled variants of laboratory experiments, we argue that to do so would be to seriously mischaracterize them. What passes for “control ” in laboratory experiments might in fact be precisely the opposite if it is artificial to the subject or context of the task. We propose six factors that can be used to determine the field context of an experiment: the nature of the subject pool, the nature of the information that the subjects bring to the task, the nature of the commodity, the nature of the task or trading rules applied, the nature
Primality Testing and Randomized Algorithms
"... .94> for some b. There is a useful necessary and sufficient condition for primality. Take a positive integer n. Say that a 2 Z n n f 0 g passes the Fermat's test just in case a n\Gamma1 = 1 mod n. Proposition 8.2 (Fermat's Little Theorem) A number n ? 2 is prime if and only if every ..."
Abstract
 Add to MetaCart
.94> for some b. There is a useful necessary and sufficient condition for primality. Take a positive integer n. Say that a 2 Z n n f 0 g passes the Fermat's test just in case a n\Gamma1 = 1 mod n. Proposition 8.2 (Fermat's Little Theorem) A number n ? 2 is prime if and only
Evaluating Las Vegas algorithms  pitfalls and remedies
 IN PROCEEDINGS OF THE FOURTEENTH CONFERENCE ON UNCERTAINTY IN ARTIFICIAL INTELLIGENCE (UAI98
, 1998
"... Stochastic search algorithms are among the most sucessful approaches for solving hard combinatorial problems. A large class of stochastic search approaches can be cast into the framework of Las Vegas Algorithms (LVAs). As the runtime behavior of LVAs is characterized by random variables, the detail ..."
Abstract

Cited by 66 (21 self)
 Add to MetaCart
Stochastic search algorithms are among the most sucessful approaches for solving hard combinatorial problems. A large class of stochastic search approaches can be cast into the framework of Las Vegas Algorithms (LVAs). As the runtime behavior of LVAs is characterized by random variables
CS 787: Advanced Algorithms Topic: Primality Testing
"... Primality test is a test to determine whether a given number is prime or not. These tests can be either deterministic or probabilistic. Deterministic tests determine absolutely whether a given number is prime or not. Probabilistic tests may, with some small probability, identify a ..."
Abstract
 Add to MetaCart
Primality test is a test to determine whether a given number is prime or not. These tests can be either deterministic or probabilistic. Deterministic tests determine absolutely whether a given number is prime or not. Probabilistic tests may, with some small probability, identify a
On the Empirical Evaluation of Las Vegas Algorithms
, 1999
"... We advocate a new methodology for empirically analysing the behaviour of Las Vegas Algorithms, a large class of probabilistic algorithms comprising prominent methods such as local search algorithms for SAT and CSPs, like WalkSAT and the MinConflicts Heuristic, as well as more general metaheurist ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We advocate a new methodology for empirically analysing the behaviour of Las Vegas Algorithms, a large class of probabilistic algorithms comprising prominent methods such as local search algorithms for SAT and CSPs, like WalkSAT and the MinConflicts Heuristic, as well as more general
Fast primality testing for integers that fit . . .
"... For large integers, the most efficient primality tests are probabilistic. However, for integers with a small fixed number of bits the best tests in practice are deterministic. Currently the best known tests of this type involve 3 rounds of the MillerRabin test for 32bit integers and 7 rounds for 6 ..."
Abstract
 Add to MetaCart
. Up to our knowledge, our implementations are the fastest oneshot deterministic primality tests for 32bit and 64bit integers to date. We also provide empirical evidence that our algorithms are fast in practice and that the data segment is roughly as small as possible for an algorithm of this type.
Two Observations on Probabilistic Primality Testing
, 1987
"... In this note, we make two loosely related observations on Rabin's probabilistic primality test. The first remark gives a rather strange and provocative reason as to why is Rabin's test so good. It turns out that a single iteration fails with a nonnegligible probability on a composite numb ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
number of the form 4j +3 only if this number happens to be easy to split. The second observation is much more fundamental because is it not restricted to primality testing: it has profound consequences for the entire field of probabilistic algorithms. There we ask the question: how good is Rabin
Results 1  10
of
4,786