1757 search results - page 1 / 352 » Alternating Refinement Relations |
CONCUR
1998
Springer
13 years 9 months ago
1998
Springer
Alternating transition systems are a general model for composite systems which allow the study of collaborative as well as adversarial relationships between individual system compo...
COMBINATORICS
2000
13 years 4 months ago
2000
We prove a conjecture of Cohn and Propp, which refines a conjecture of Bosley and Fidkowski about the symmetry of the set of alternating sign matrices (ASMs). We examine data aris...
MPC
1995
Springer
13 years 8 months ago
1995
Springer
This paper proposes a refinement relation supporting the transition from unbounded to bounded communication buffers. Employing this refinement relation, a system specification base...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Hartmanis used Kolmogorov complexity to provide an alternate proof of the classical result of Baker, Gill, and Solovay that there is an oracle relative to which P is not NP. We re...
BMCBI
2010
12 years 12 months ago
2010
Background: The dynamic motions of many proteins are central to their function. It therefore follows that the dynamic requirements of a protein are evolutionary constrained. In or...