98 search results - page 1 / 20 » A note on weak dividing |
AML
2007
13 years 5 months ago
2007
We study the notion of weak dividing introduced by S. Shelah. In particular we prove that T is stable iff weak dividing is symmetric. In order to study simple theories Shelah orig...
ENTCS
2007
13 years 5 months ago
2007
In this notes we consider the model of Generative Probabilistic Transition Systems, and Baier and Hermanns’ notion of weak bisimulation defined over them. We prove that, if we ...
DAM
2006
13 years 5 months ago
2006
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...
ARITH
1997
IEEE
13 years 9 months ago
1997
IEEE
SRT dividers are common in modern floating point units. Higher division performance is achieved by retiring more quotient bits in each cycle. Previous research has shown that rea...
COGSR
2010
13 years 18 days ago
2010
We examine Dubois's [Dubois, D., 2003. Mathematical foundations of discrete and functional systems with strong and weak anticipations. Lecture Notes in Computer Science 2684,...