Results 1  10
of
153,538
Sequential Asm Thesis
 Bull. European Assoc. Theor. Comp. Sci
, 1999
"... state machines (ASMs) used to be called evolving algebras. The sequential ASM thesis and its extensions [Gurevich 1995] inspired diverse applications of ASMs. The early applications were driven, at least partially, by the desire to test the thesis. Di#erent programming languages were the obvious cha ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
state machines (ASMs) used to be called evolving algebras. The sequential ASM thesis and its extensions [Gurevich 1995] inspired diverse applications of ASMs. The early applications were driven, at least partially, by the desire to test the thesis. Di#erent programming languages were the obvious
Dynamic Bayesian Networks: Representation, Inference and Learning
, 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 biosequence analysis, and KFMs have bee ..."
Abstract

Cited by 768 (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
Algorithms for Sequential Decision Making
, 1996
"... Sequential decision making is a fundamental task faced by any intelligent agent in an extended interaction with its environment; it is the act of answering the question "What should I do now?" In this thesis, I show how to answer this question when "now" is one of a finite set of ..."
Abstract

Cited by 213 (8 self)
 Add to MetaCart
Sequential decision making is a fundamental task faced by any intelligent agent in an extended interaction with its environment; it is the act of answering the question "What should I do now?" In this thesis, I show how to answer this question when "now" is one of a finite set
The Power of Two Choices in Randomized Load Balancing
 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
, 1996
"... Suppose that n balls are placed into n bins, each ball being placed into a bin chosen independently and uniformly at random. Then, with high probability, the maximum load in any bin is approximately log n log log n . Suppose instead that each ball is placed sequentially into the least full of d ..."
Abstract

Cited by 292 (23 self)
 Add to MetaCart
Suppose that n balls are placed into n bins, each ball being placed into a bin chosen independently and uniformly at random. Then, with high probability, the maximum load in any bin is approximately log n log log n . Suppose instead that each ball is placed sequentially into the least full
On Gurevich’s Theorem for Sequential ASM
"... AbstractState Machines have been introduced as “a computation model that is more powerful and more universal than standard computation models”, by Yuri Gurevich in 1985 ([Gur85]). ASM gained much attention as a specification method, in particular for the description of the semantics of programmin ..."
Abstract
 Add to MetaCart
of programming languages, communication protocols, distributed algorithms, etc. Gurevich proved recently that a sequential algorithm must only meet a few, liberal requirements, to be representable as an ASM. We reformulate Gurevich’s requirements for sequential algorithms, as well as the semantics of ASM
ASM
"... State Machine (ASM) method is a systems engineering method that guides the development of software and embedded hardwaresoftware systems seamlessly from requirements capture to their implementation. Within a single precise yet simple conceptual framework, the ASM method supports and uniformly integ ..."
Abstract
 Add to MetaCart
State Machine (ASM) method is a systems engineering method that guides the development of software and embedded hardwaresoftware systems seamlessly from requirements capture to their implementation. Within a single precise yet simple conceptual framework, the ASM method supports and uniformly
Composition and Submachine Concepts for Sequential ASMs
 Computer Science Logic (Proceedings of CSL 2000), volume 1862 of LNCS
, 2000
"... We define three composition and structuring concepts which... ..."
Abstract

Cited by 29 (13 self)
 Add to MetaCart
We define three composition and structuring concepts which...
Rich SequentialTime ASMs
, 2001
"... Introduction Software industry can use a good specification language. This specification language should be executable, and so ASMs become relevant. The language should allow one to integrate specifications with existing technologies. To meet this need, our group in Microsoft Research builds a powe ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
objects and we extend the theory of original ASMs to provide a solid semantic foundation for ASML. The explicitly distributed version of ASML is yet to be implemented; accordingly we deal only with sequentialtime computing in this paper. 2 Extension Layers Our starting point is the ASM model
XML Database Transformations
"... Abstract: Database transformations provide a unifying umbrella for queries and updates. In general, they can be characterised by five postulates, which constitute the database analogue of Gurevich’s sequential ASM thesis. Among these postulates the background postulate supposedly captures the parti ..."
Abstract
 Add to MetaCart
Abstract: Database transformations provide a unifying umbrella for queries and updates. In general, they can be characterised by five postulates, which constitute the database analogue of Gurevich’s sequential ASM thesis. Among these postulates the background postulate supposedly captures
Results 1  10
of
153,538