28 search results - page 1 / 6 » Reduced Canonical Forms of Stoppers |
COMBINATORICS
2006
13 years 11 months ago
2006
The reduced canonical form of a loopfree game G is the simplest game infinitesimally close to G. Reduced canonical forms were introduced by Calistrate, and Grossman and Siegel pro...
QEST
2010
IEEE
13 years 8 months ago
2010
IEEE
The importance of the order two Markovian arrival process (MAP(2)) comes from its compactness, serving either as arrival or service process in applications, and from the nice prope...
ICFP
2004
ACM
14 years 11 months ago
2004
ACM
We study a type system equipped with universal types and equirecursive types, which we refer to as F?. We show that type equality may be decided in time O(n log n), an improvement...
DAC
1994
ACM
14 years 3 months ago
1994
ACM
-- In this paper we present a new method for Boolean matching of completely specified Boolean functions. The canonical Generalized Reed-Muller forms are used as a powerful analysis...
CADE
2003
Springer
14 years 11 months ago
2003
Springer
If there exist efficient procedures (canonizers) for reducing terms of two first-order theories to canonical form, can one use them to construct such a procedure for terms of the d...