5084 search results - page 161 / 1017 » Proving Possibility Properties |
154
click to vote
COMBINATORICS
1998
15 years 6 months ago
1998
We prove that the minimal length of a word Sn having the property that it contains exactly Fm+2 distinct subwords of length m for 1 ≤ m ≤ n is Fn + Fn+2. Here Fn is the nth Fi...
122
click to vote
SIGACT
2002
15 years 6 months ago
2002
When designing distributed web services, there are three properties that are commonly desired: consistency, availability, and partition tolerance. It is impossible to achieve all ...
156
click to vote
RSA
2008
15 years 5 months ago
2008
: In this article, we initiate a systematic study of graph resilience. The (local) resilience of a graph G with respect to a property P measures how much one has to change G (local...
157
click to vote
ARSCOM
2008
15 years 5 months ago
2008
A total perfect code in a graph is a subset of the graph's vertices with the property that each vertex in the graph is adjacent to exactly one vertex in the subset. We prove t...
163
click to vote
MOR
2010
15 years 4 months ago
2010
We explicitly solve the optimal switching problem for one-dimensional diffusions by directly employing the dynamic programming principle and the excessive characterization of the ...