Sciweavers

2283 search results - page 436 / 457
» Bounds of Graph Characteristics
Sort
View
MOBIHOC
2002
ACM
16 years 1 days ago
On the minimum node degree and connectivity of a wireless multihop network
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
Christian Bettstetter
102
Voted
IPPS
2009
IEEE
15 years 7 months ago
Implementing and evaluating multithreaded triad census algorithms on the Cray XMT
Commonly represented as directed graphs, social networks depict relationships and behaviors among social entities such as people, groups, and organizations. Social network analysi...
George Chin Jr., Andrès Márquez, Sut...
133
Voted
IEEEPACT
2008
IEEE
15 years 6 months ago
Feature selection and policy optimization for distributed instruction placement using reinforcement learning
Communication overheads are one of the fundamental challenges in a multiprocessor system. As the number of processors on a chip increases, communication overheads and the distribu...
Katherine E. Coons, Behnam Robatmili, Matthew E. T...
90
Voted
INFOCOM
2008
IEEE
15 years 6 months ago
Area Avoidance Routing in Distance-Vector Networks
Network routing may be required, under certain applications, to avoid certain areas (or nodes) These areas can be of potential security threat, possess poor quality or have other ...
Haim Zlatokrilov, Hanoch Levy
110
Voted
INFOCOM
2008
IEEE
15 years 6 months ago
Towards Optimal Resource Allocation in Partial-Fault Tolerant Applications
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...
Nikhil Bansal, Ranjita Bhagwan, Navendu Jain, Yoon...