Sciweavers

4865 search results - page 373 / 973
» The Complexity of Graph Connectivity
Sort
View
RSA
2008
85views more  RSA 2008»
15 years 6 months ago
Quasi-random graphs with given degree sequences
It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of neces...
Fan Chung Graham, Ronald L. Graham
CN
2006
111views more  CN 2006»
15 years 6 months ago
Analytical modeling of CAC in next generation wireless systems
Though Connection Admission Control (CAC) in wireless networks has been studied extensively, the heterogeneous structure of Next Generation Wireless Systems (NGWS) makes CAC very ...
Tuna Tugcu, H. Birkan Yilmaz, Feodor S. Vainstein
CONNECTION
2004
117views more  CONNECTION 2004»
15 years 6 months ago
Structure and function of evolved neuro-controllers for autonomous robots
The Artificial Life approach to Evolutionary Robotics is used as a fundamental framework for the development of a modular neural control of autonomous mobile robots. The applied e...
Martin Hülse, Steffen Wischmann, Frank Pasema...
PERCOM
2006
ACM
16 years 6 months ago
A Dynamic Graph Algorithm for the Highly Dynamic Network Problem
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
Edwin Soedarmadji, Robert J. McEliece
SDM
2009
SIAM
118views Data Mining» more  SDM 2009»
16 years 4 months ago
Finding Links and Initiators: A Graph-Reconstruction Problem.
Consider a 0–1 observation matrix M, where rows correspond to entities and columns correspond to signals; a value of 1 (or 0) in cell (i, j) of M indicates that signal j has bee...
Evimaria Terzi, Heikki Mannila