• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 3,653,428
Next 10 →

Guarded Commands, Nondeterminacy and Formal Derivation of Programs

by Edsger W. Dijkstra , 1975
"... So-called "guarded commands" are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniqilely determined by the initial state. ..."
Abstract - Cited by 521 (0 self) - Add to MetaCart
So-called "guarded commands" are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniqilely determined by the initial state

Accurate transcription initiation by RNA polymerase II in a soluble extract from isolated mammalian nuclei. Nucleic Acids Res

by John David Dignam, Russell M. Lebovitz, Robert G. Roeder , 1983
"... We have developed a procedure for preparing extracts from nuclei of human tissue culture cells that directs accurate transcription initiation in vitro from class II promoters. Conditions of extraction and assay have been optimized for maximum activity using the major late promoter of adenovirus 2. T ..."
Abstract - Cited by 1054 (11 self) - Add to MetaCart
We have developed a procedure for preparing extracts from nuclei of human tissue culture cells that directs accurate transcription initiation in vitro from class II promoters. Conditions of extraction and assay have been optimized for maximum activity using the major late promoter of adenovirus 2

GOLOG: A Logic Programming Language for Dynamic Domains

by Hector J. Levesque, Raymond Reiter, Yves Lespérance, Fangzhen Lin, Richard B. Scherl , 1994
"... This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and effects of actions and the initial state of the world. This allo ..."
Abstract - Cited by 621 (72 self) - Add to MetaCart
This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and effects of actions and the initial state of the world

Initial-state

by unknown authors , 2007
"... EPJ manuscript No. (will be inserted by the editor) ..."
Abstract - Add to MetaCart
EPJ manuscript No. (will be inserted by the editor)

Initial-state

by Ya. A. Berdnikov, V. T. Kim, V. F. Kosmach, M. M. Ryzhinskiy, V. M. Samsonov, M. E. Zavatsky , 2005
"... EPJ manuscript No. (will be inserted by the editor) ..."
Abstract - Add to MetaCart
EPJ manuscript No. (will be inserted by the editor)

Virtual Time and Global States of Distributed Systems

by Friedemann Mattern - PARALLEL AND DISTRIBUTED ALGORITHMS , 1988
"... A distributed system can be characterized by the fact that the global state is distributed and that a common time base does not exist. However, the notion of time is an important concept in every day life of our decentralized "real world" and helps to solve problems like getting a consiste ..."
Abstract - Cited by 741 (6 self) - Add to MetaCart
A distributed system can be characterized by the fact that the global state is distributed and that a common time base does not exist. However, the notion of time is an important concept in every day life of our decentralized "real world" and helps to solve problems like getting a

Missing data: Our view of the state of the art

by Joseph L. Schafer, John W. Graham - Psychological Methods , 2002
"... Statistical procedures for missing data have vastly improved, yet misconception and unsound practice still abound. The authors frame the missing-data problem, review methods, offer advice, and raise issues that remain unresolved. They clear up common misunderstandings regarding the missing at random ..."
Abstract - Cited by 689 (1 self) - Add to MetaCart
developments are discussed, including some for dealing with missing data that are not MAR. Although not yet in the main-stream, these procedures may eventually extend the ML and MI methods that currently represent the state of the art. Why do missing data create such difficulty in sci-entific research? Because

Impulses and Physiological States in Theoretical Models of Nerve Membrane

by Richard Fitzhugh - Biophysical Journal , 1961
"... ABSTRACT Van der Pol's equation for a relaxation oscillator is generalized by the addition of terms to produce a pair of non-linear differential equations with either a stable singular point or a limit cycle. The resulting "BVP model " has two variables of state, representing excitabi ..."
Abstract - Cited by 496 (0 self) - Add to MetaCart
ABSTRACT Van der Pol's equation for a relaxation oscillator is generalized by the addition of terms to produce a pair of non-linear differential equations with either a stable singular point or a limit cycle. The resulting "BVP model " has two variables of state, representing

Automatic verification of finite-state concurrent systems using temporal logic specifications

by E. M. Clarke, E. A. Emerson, A. P. Sistla - ACM Transactions on Programming Languages and Systems , 1986
"... We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a (propositional, branching-time) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract - Cited by 1384 (62 self) - Add to MetaCart
We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a (propositional, branching-time) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent

Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial

by Fred B. Schneider - ACM COMPUTING SURVEYS , 1990
"... The state machine approach is a general method for implementing fault-tolerant services in distributed systems. This paper reviews the approach and describes protocols for two different failure models--Byzantine and fail-stop. System reconfiguration techniques for removing faulty components and i ..."
Abstract - Cited by 972 (10 self) - Add to MetaCart
The state machine approach is a general method for implementing fault-tolerant services in distributed systems. This paper reviews the approach and describes protocols for two different failure models--Byzantine and fail-stop. System reconfiguration techniques for removing faulty components
Next 10 →
Results 1 - 10 of 3,653,428
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University