1716 search results - page 158 / 344 » Proving Conditional Termination |
77
Voted
JGT
2010
14 years 11 months ago
2010
Sufficient degree conditions for the existence of properly edge-colored cycles and paths in edge-colored graphs, multigraphs and random graphs are inverstigated. In particular, we...
88
Voted
SIAMCO
2010
14 years 11 months ago
2010
We consider control systems of the type ˙x = Ax+α(t)bu, where u ∈ R, (A, b) is a controllable pair and α is an unknown time-varying signal with values in [0, 1] satisfying a ...
93
Voted
CDC
2010
IEEE
14 years 7 months ago
2010
IEEE
We derive lower bounds on the convergence speed of a widely used class of distributed averaging algorithms. In particular, we prove that any distributed averaging algorithm whose ...
79
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We consider continuous-time consensus seeking systems whose time-dependent interactions are cut-balanced, in the following sense: if a group of agents influences the remaining on...
135
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We prove a strong Symmetry of Information relation for random strings (in the sense of Kolmogorov complexity) and establish tight bounds on the amount on nonuniformity that is nec...