5084 search results - page 394 / 1017 » Proving Possibility Properties |
198
click to vote
SIAMDM
2010
15 years 5 months ago
2010
A set of vertices C in a graph is convex if it contains all vertices which lie on shortest paths between vertices in C. The convex hull of a set of vertices S is the smallest conve...
204
click to vote
APN
2009
Springer
16 years 1 months ago
2009
Springer
In [LJ06] Lorenz and Juh´as raised the question of whether there exists a suitable formalism for the representation of infinite families of partial orders generated by Petri nets...
223
click to vote
DMTCS
2010
15 years 4 months ago
2010
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
189
click to vote
DM
2011
15 years 1 months ago
2011
Fix an element x of a finite partially ordered set P on n elements. Then let hi(x) be the number of linear extensions of P in which x is in position i, counting from the bottom. T...
154
click to vote
IJACT
2010
15 years 1 months ago
2010
: We look at message recognition protocols (MRPs) and prove that there is a oneto-one correspondence between stateless non-interactive MRPs and digital signature schemes. Next, we ...