3731 search results - page 421 / 747 » cases 2006 |
167
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
We define type-B analogues of combinatorial statistics previously studied on noncrossing partitions and show that analogous equidistribution and symmetry properties hold in the ca...
152
click to vote
COMBINATORICS
2002
15 years 6 months ago
2002
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is ...
185
click to vote
FAC
2000
15 years 6 months ago
2000
Formal approaches to the design of interactive systems rely on reasoning about properties of the t a very high level of abstraction. Specifications to support such an approach typi...
145
click to vote
FAC
2000
15 years 6 months ago
2000
Typically, program design involves constructing a program P that implements a given specification S; that is, the set P of executions of P is a subset of the set S of executions s...
179
click to vote
FUIN
2000
15 years 6 months ago
2000
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...