5922 search results - page 1130 / 1185 » Navigability of Complex Networks |
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
144
Voted
ICANN
2010
Springer
14 years 11 months ago
2010
Springer
Trajectory formation is one of the basic functions of the neuromotor controller. In particular, reaching, avoiding, controlling impacts (hitting), drawing, dancing and imitating ar...
114
Voted
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
—In IEEE 802.22 Wireless Regional Area Networks (WRANs), each Base Station (BS) solves a complex resource allocation problem of simultaneously determining the channel to reuse, p...
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract—When forwarding packets in the Internet, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy kn...
116
Voted
JCM
2010
14 years 11 months ago
2010
— Explicit congestion control schemes use router feedback to overcome limitations of the standard mechanisms of the Transmission Control Protocol (TCP). These approaches require ...