9949 search results - page 93 / 1990 » On the Network Complexity of Selection |
ALGOSENSORS
2004
Springer
14 years 2 months ago
2004
Springer
Determining the positions of the sensor nodes in a network is essential to many network functionalities such as routing, coverage and tracking, and event detection. The localizatio...
NC
2007
13 years 8 months ago
2007
Abstract. We study latching dynamics, i.e. the ability of a network to hop spontaneously from one discrete attractor state to another, which has been proposed as a model of an inï¬...
WIOPT
2010
IEEE
13 years 7 months ago
2010
IEEE
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
FCCM
2011
IEEE
13 years 12 days ago
2011
IEEE
Abstract—Ballooning trafï¬c volumes and increasing linkspeeds require ever high compute power to perform complex real-time processing of network packets. FPGAs have already been...
HICSS
2012
IEEE
12 years 4 months ago
2012
IEEE
—The selection of a path in a network from one node to another is performed by a routing protocol, often using the shortest path approach. However, it has been shown that in wire...