Results 1 - 10 of 119,620

Symbolic Model Checking for Real-time Systems

by Thomas A. Henzinger, Xavier Nicollin, Joseph Sifakis, Sergio Yovine - INFORMATION AND COMPUTATION , 1992
"... We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given in an ..."
Abstract - Cited by 578 (50 self) - Add to MetaCart
, many standard program properties, such as response for all nonzeno execution sequences (during which time diverges), cannot be characterized by fixpoints: we show that the expressiveness of the timed -calculus is incomparable to the expressiveness of timed CTL. Fortunately, this result does

The Cyclical Behavior of Equilibrium Unemployment and Vacancies

by Robert Shimer - American Economic Review , 2005
"... This paper argues that a broad class of search models cannot generate the observed business-cycle-frequency fluctuations in unemployment and job vacancies in response to shocks of a plausible magnitude. In the U.S., the vacancy-unemployment ratio is 20 times as volatile as average labor productivity ..."
Abstract - Cited by 871 (23 self) - Add to MetaCart
This paper argues that a broad class of search models cannot generate the observed business-cycle-frequency fluctuations in unemployment and job vacancies in response to shocks of a plausible magnitude. In the U.S., the vacancy-unemployment ratio is 20 times as volatile as average labor

A comparative analysis of selection schemes used in genetic algorithms

by David E. Goldberg, Kalyanmoy Deb - 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 531 (31 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

The complexity of theorem-proving procedures

by Stephen A. Cook - IN STOC , 1971
"... It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved deterministi ..."
Abstract - Cited by 1050 (5 self) - Add to MetaCart
deterministically in polynomial time provided an oracle is available for solving the second. From this notion of reducible, polynomial degrees of difficulty are defined, and it is shown that the problem of determining tautologyhood has the same polynomial degree as the problem of determining whether the first

Non-Deterministic Exponential Time has Two-Prover Interactive Protocols

by Laszlo Babai, Lance Fortnow, Carsten Lund
"... We determine the exact power of two-prover inter-active proof systems introduced by Ben-Or, Goldwasser, Kilian, and Wigderson (1988). In this system, two all-powerful non-communicating provers convince a randomizing polynomial time verifier in polynomial time that the input z belongs to the language ..."
Abstract - Cited by 416 (37 self) - Add to MetaCart
We determine the exact power of two-prover inter-active proof systems introduced by Ben-Or, Goldwasser, Kilian, and Wigderson (1988). In this system, two all-powerful non-communicating provers convince a randomizing polynomial time verifier in polynomial time that the input z belongs

On Sequential Monte Carlo Sampling Methods for Bayesian Filtering

by Arnaud Doucet, Simon Godsill, Christophe Andrieu - STATISTICS AND COMPUTING , 2000
"... In this article, we present an overview of methods for sequential simulation from posterior distributions. These methods are of particular interest in Bayesian filtering for discrete time dynamic models that are typically nonlinear and non-Gaussian. A general importance sampling framework is develop ..."
Abstract - Cited by 1051 (76 self) - Add to MetaCart
In this article, we present an overview of methods for sequential simulation from posterior distributions. These methods are of particular interest in Bayesian filtering for discrete time dynamic models that are typically nonlinear and non-Gaussian. A general importance sampling framework

Verbal reports as data

by K. Anders Ericsson, Herbert A. Simon - Psychological Review , 1980
"... The central proposal of this article is that verbal reports are data. Accounting for verbal reports, as for other kinds of data, requires explication of the mech-anisms by which the reports are generated, and the ways in which they are sensitive to experimental factors (instructions, tasks, etc.). W ..."
Abstract - Cited by 513 (3 self) - Add to MetaCart
research are shown to result from requesting information that was never directly heeded, thus forcing subjects to infer rather than remember their mental processes. After a long period of time during which stimulus-response relations were at the focus of attention, research in psychology is now seeking

On the time course of perceptual choice: the leaky competing accumulator model

by Marius Usher, James L. McClelland - PSYCHOLOGICAL REVIEW , 2001
"... The time course of perceptual choice is discussed in a model based on gradual and stochastic accumulation of information in non-linear decision units with leakage (or decay of activation) and competition through lateral inhibition. In special cases, the model becomes equivalent to a classical diffus ..."
Abstract - Cited by 480 (19 self) - Add to MetaCart
diffusion process, but leakage and mutual inhibition work together to address several challenges to existing diffusion, random-walk, and accumulator models. The model provides a good account of data from choice tasks using both time-controlled (e.g., deadline or response signal) and standard reaction time

Dynamic Bayesian Networks: Representation, Inference and Learning

by Kevin Patrick Murphy , 2002
"... Modelling sequential data is important in many areas of science and engineering. Hidden Markov models (HMMs) and Kalman filter models (KFMs) are popular for this because they are simple and flexible. For example, HMMs have been used for speech recognition and bio-sequence analysis, and KFMs have bee ..."
Abstract - Cited by 770 (3 self) - Add to MetaCart
sequential data. In particular, the main novel technical contributions of this thesis are as follows: a way of representing Hierarchical HMMs as DBNs, which enables inference to be done in O(T) time instead of O(T 3), where T is the length of the sequence; an exact smoothing algorithm that takes O(log T

Promoting the Use of End-to-End Congestion Control in the Internet

by Sally Floyd, Kevin Fall - IEEE/ACM TRANSACTIONS ON NETWORKING , 1999
"... This paper considers the potentially negative impacts of an increasing deployment of non-congestion-controlled best-effort traffic on the Internet.’ These negative impacts range from extreme unfairness against competing TCP traffic to the potential for congestion collapse. To promote the inclusion ..."
Abstract - Cited by 875 (14 self) - Add to MetaCart
conformant TCP in the same circumstances. An unresponsive flow is one failing to reduce its offered load at a router in response to an increased packet drop rate, and a disproportionate-bandwidth flow is one that uses considerably more bandwidth than other flows in a time of congestion.
Results 1 - 10 of 119,620