Results 1  10
of
2,583,327
Universal Constructions for Large Objects
 Proceedings of the Ninth International Workshop on Distributed Algorithms, Lecture Notes in Computer Science 972
, 1995
"... We present lockfree and waitfree universal constructions for implementing large shared objects. Most previous universal constructions require processes to copy the entire object state, which is impractical for large objects. Previous attempts to address this problem require programmers to explicit ..."
Abstract

Cited by 58 (18 self)
 Add to MetaCart
We present lockfree and waitfree universal constructions for implementing large shared objects. Most previous universal constructions require processes to copy the entire object state, which is impractical for large objects. Previous attempts to address this problem require programmers
Universal Constructs in Distributed Computations
, 1996
"... This paper presents two classes of universal constructs that occur in distributed computations and explores their properties. It first examines a pair of universal constructs termed IO and OI intervals that occur at nodes in distributed computations. These universal constructs are used as building ..."
Abstract
 Add to MetaCart
This paper presents two classes of universal constructs that occur in distributed computations and explores their properties. It first examines a pair of universal constructs termed IO and OI intervals that occur at nodes in distributed computations. These universal constructs are used as building
A Thrifty Universal Construction
"... Abstract. A universal construction is an algorithm which transforms any sequential implementation of an object into a concurrent implementation of that same object in a linearizable and waitfree manner. Such constructions require underlying lowlevel universal shared objects such as compareandsw ..."
Abstract
 Add to MetaCart
Abstract. A universal construction is an algorithm which transforms any sequential implementation of an object into a concurrent implementation of that same object in a linearizable and waitfree manner. Such constructions require underlying lowlevel universal shared objects such as compare
UPPAAL in a Nutshell
, 1997
"... . This paper presents the overall structure, the design criteria, and the main features of the tool box Uppaal. It gives a detailed user guide which describes how to use the various tools of Uppaal version 2.02 to construct abstract models of a realtime system, to simulate its dynamical behavior, ..."
Abstract

Cited by 657 (49 self)
 Add to MetaCart
. This paper presents the overall structure, the design criteria, and the main features of the tool box Uppaal. It gives a detailed user guide which describes how to use the various tools of Uppaal version 2.02 to construct abstract models of a realtime system, to simulate its dynamical behavior
Quantum complexity theory
 in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM
, 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract

Cited by 571 (5 self)
 Add to MetaCart
Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97
Universal constructions in umbral calculus
 Mathematical Essays in Honor of GianCarlo Rota Birkhauser
, 1998
"... Modern umbral calculus is steadily approaching maturity, as applications develop in several areas of mathematics. To maximize this utility it is important to work in the most general (as opposed to the most abstract) ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Modern umbral calculus is steadily approaching maturity, as applications develop in several areas of mathematics. To maximize this utility it is important to work in the most general (as opposed to the most abstract)
Universal Constructions for MultiObject Operations (Extended Abstract)
 PROCEEDINGS OF THE 14TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING
, 1995
"... We present waitfree and lockfree universal constructions that allow operations to access multiple objects atomically. Such constructions provide functionality similar to nested critical sections in conventional, lockbased systems. In such a system, two critical sections might be nested, for exampl ..."
Abstract

Cited by 72 (19 self)
 Add to MetaCart
We present waitfree and lockfree universal constructions that allow operations to access multiple objects atomically. Such constructions provide functionality similar to nested critical sections in conventional, lockbased systems. In such a system, two critical sections might be nested
RealTime Computing Without Stable States: A New Framework for Neural Computation Based on Perturbations
"... A key challenge for neural modeling is to explain how a continuous stream of multimodal input from a rapidly changing environment can be processed by stereotypical recurrent circuits of integrateandfire neurons in realtime. We propose a new computational model for realtime computing on timevar ..."
Abstract

Cited by 463 (38 self)
 Add to MetaCart
varying input that provides an alternative to paradigms based on Turing machines or attractor neural networks. It does not require a taskdependent construction of neural circuits. Instead it is based on principles of high dimensional dynamical systems in combination with statistical learning theory, and can
Universal Plans for Reactive Robots in Unpredictable Environments
, 1987
"... In: Proc 10th IJCAI, 1987, 1039ff. To date, reactive robot behavior has been achieved only through manual programming. This paper describes a new kind of plan, called a "universal plan", which can be synthesized automatically, yet generates appropriate behavior in unpredictable environmen ..."
Abstract

Cited by 376 (0 self)
 Add to MetaCart
. An alternative conception is that one universal plan compactly represents every classical plan. Which part of the universal plan is executed depends entirely on how the environment behaves at execution time. Universal plans are constructed from statespace operator schemas by a nonlinear planner. They explicitly
Results 1  10
of
2,583,327