3008 search results - page 429 / 602 » Independence in connected graphs |
132
click to vote
INFOCOM
1993
IEEE
15 years 11 months ago
1993
IEEE
Passive, single-hop interconnections among N stations, each with several transmitters and receivers, provide a communication path between any two stations using one of the transmi...
225
click to vote
SC
1993
ACM
15 years 11 months ago
1993
ACM
In this paper, we describe two new ideas by which HPF compiler can deal with irregular computations e ectively. The rst mechanism invokes a user speci ed mapping procedure via a s...
218
click to vote
SIGGRAPH
1994
ACM
15 years 11 months ago
1994
ACM
This paper describes a novel system for creating virtual creatures that move and behave in simulated three-dimensional physical worlds. The morphologies of creatures and the neura...
162
click to vote
COMPGEOM
1990
ACM
15 years 11 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
183
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
This paper considers the controllability problem for multi-agent systems. In particular, the structural controllability of multi-agent systems with a single leader under switching ...