3267 search results - page 447 / 654 » Generalized quasirandom graphs |
184
click to vote
TAPSOFT
1997
Springer
15 years 10 months ago
1997
Springer
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
127
click to vote
INFOCOM
1993
IEEE
15 years 10 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...
171
click to vote
ICRA
1994
IEEE
15 years 10 months ago
1994
IEEE
This paper describes some initial steps towards sensor based path planning in an unknown static environment. The method is a based on a sensor-based incremental construction of a o...
162
click to vote
ICPP
1992
IEEE
15 years 10 months ago
1992
IEEE
-- Distributed routing algorithms presented in the literature have tended to be specific to a particular network topology. In order to test the applicability of various routing str...
174
click to vote
CDC
2009
IEEE
15 years 10 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 ...