1729 search results - page 121 / 346 » Bound Graph Polysemy |
143
click to vote
ICRA
2008
IEEE
16 years 20 days ago
2008
IEEE
Abstract— A distributed control law that guarantees connectivity maintenance in a network of multiple mobile agents is presented. The control law respects the limited sensing cap...
170
click to vote
FSTTCS
2007
Springer
16 years 12 days ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
145
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
144
Voted
VTS
2006
IEEE
16 years 7 days ago
2006
IEEE
A new algorithm for identifying stuck faults in combinational circuits that cannot be detected by a given input sequence is presented. Other than pre and post-processing steps, ce...
152
click to vote
FM
2009
Springer
15 years 11 months ago
2009
Springer
The problem of enforcing bounded-time 2-phase recovery in real-time programs is often necessitated by conflict between faulttolerance requirements and timing constraints. In this ...