Results 1  10
of
229,466
Realising Deterministic Behavior from Multiple NonDeterministic Behaviors
"... This paper considers the problem of composing or scheduling several (nondeterministic) behaviors so as to conform to a specified target behavior as well as satisfying constraints imposed by the environment in which the behaviors are to be performed. This problem has already been considered by sever ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper considers the problem of composing or scheduling several (nondeterministic) behaviors so as to conform to a specified target behavior as well as satisfying constraints imposed by the environment in which the behaviors are to be performed. This problem has already been considered
Transitions from stochastic to deterministic behavior in calcium oscillations
 Biophys. J
, 2005
"... ABSTRACT Simulation and modeling is becoming more and more important when studying complex biochemical systems. Most often, ordinary differential equations are employed for this purpose. However, these are only applicable when the numbers of participating molecules in the biochemical systems are lar ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
study the transition from stochastic to deterministic behavior in a widely studied system, namely the signal transduction via calcium, especially calcium oscillations. We observe that the transition occurs within a range of particle numbers, which roughly corresponds to the number of receptors
The Cyclical Behavior of Equilibrium Unemployment and Vacancies
 American Economic Review
, 2005
"... This paper argues that a broad class of search models cannot generate the observed businesscyclefrequency fluctuations in unemployment and job vacancies in response to shocks of a plausible magnitude. In the U.S., the vacancyunemployment ratio is 20 times as volatile as average labor productivity ..."
Abstract

Cited by 839 (20 self)
 Add to MetaCart
productivity, while under weak assumptions, search models predict that the vacancyunemployment ratio and labor productivity have nearly the same variance. I establish this claim both using analytical comparative statics in a very general deterministic search model and using simulations of a stochastic version
Adolescencelimited and lifecoursepersistent antisocial behavior: Adevelopmental taxonomy
 Psychological Review
, 1993
"... A dual taxonomy is presented to reconcile 2 incongruous facts about antisocial behavior: (a) It shows impressive continuity over age, but (b) its prevalence changes dramatically over age, increasing almost 10fold temporarily during adolescence. This article suggests that delinquency conceals 2 dist ..."
Abstract

Cited by 549 (4 self)
 Add to MetaCart
A dual taxonomy is presented to reconcile 2 incongruous facts about antisocial behavior: (a) It shows impressive continuity over age, but (b) its prevalence changes dramatically over age, increasing almost 10fold temporarily during adolescence. This article suggests that delinquency conceals 2
Patterns in Testing Concurrent Programs with Nondeterministic Behaviors∗
"... Concurrent programs are hard to test because of the nondeterminism inherit in them. Since nondeterminism is one of the major sources of bugs, it is important to to be tested. We studied the test suites of four open source concurrent libraries and discovered that the tests fall into three differen ..."
Abstract
 Add to MetaCart
Concurrent programs are hard to test because of the nondeterminism inherit in them. Since nondeterminism is one of the major sources of bugs, it is important to to be tested. We studied the test suites of four open source concurrent libraries and discovered that the tests fall into three different patterns. One of the patterns avoids testing nondeterminism while the other two control the schedule of the program execution to manage that.
A comparative analysis of selection schemes used in genetic algorithms
 Foundations of Genetic Algorithms
, 1991
"... This paper considers a number of selection schemes commonly used in modern genetic algorithms. Specifically, proportionate reproduction, ranking selection, tournament selection, and Genitor (or «steady state") selection are compared on the basis of solutions to deterministic difference or d ..."
Abstract

Cited by 512 (32 self)
 Add to MetaCart
This paper considers a number of selection schemes commonly used in modern genetic algorithms. Specifically, proportionate reproduction, ranking selection, tournament selection, and Genitor (or «steady state") selection are compared on the basis of solutions to deterministic difference
A Fast Quantum Mechanical Algorithm for Database Search
 ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING
, 1996
"... Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic)
will need to look at a minimum of names. Quantum mechanical systems can be in a supe ..."
Abstract

Cited by 1126 (10 self)
 Add to MetaCart
Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic)
will need to look at a minimum of names. Quantum mechanical systems can be in a
A Simple Estimator of Cointegrating Vectors in Higher Order Cointegrated Systems
 ECONOMETRICA
, 1993
"... Efficient estimators of cointegrating vectors are presented for systems involving deterministic components and variables of differing, higher orders of integration. The estimators are computed using GLS or OLS, and Wald Statistics constructed from these estimators have asymptotic x2 distributions. T ..."
Abstract

Cited by 507 (3 self)
 Add to MetaCart
Efficient estimators of cointegrating vectors are presented for systems involving deterministic components and variables of differing, higher orders of integration. The estimators are computed using GLS or OLS, and Wald Statistics constructed from these estimators have asymptotic x2 distributions
Mean shift, mode seeking, and clustering
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1995
"... AbstractMean shift, a simple iterative procedure that shifts each data point to the average of data points in its neighborhood, is generalized and analyzed in this paper. This generalization makes some kmeans like clustering algorithms its special cases. It is shown that mean shift is a modeseeki ..."
Abstract

Cited by 620 (0 self)
 Add to MetaCart
seeking process on a surface constructed with a “shadow ” kernel. For Gaussian kernels, mean shift is a gradient mapping. Convergence is studied for mean shift iterations. Cluster analysis is treated as a deterministic problem of finding a fixed point of mean shift that characterizes the data. Applications
Randomized Algorithms
, 1995
"... Randomized algorithms, once viewed as a tool in computational number theory, have by now found widespread application. Growth has been fueled by the two major benefits of randomization: simplicity and speed. For many applications a randomized algorithm is the fastest algorithm available, or the simp ..."
Abstract

Cited by 2210 (37 self)
 Add to MetaCart
, or the simplest, or both. A randomized algorithm is an algorithm that uses random numbers to influence the choices it makes in the course of its computation. Thus its behavior (typically quantified as running time or quality of output) varies from
Results 1  10
of
229,466