214 search results - page 18 / 43 » The node capacitated graph partitioning problem: A computati... |
127
click to vote
JPDC
2007
15 years 25 days ago
2007
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
TIT
2008
15 years 26 days ago
2008
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
105
click to vote
KDD
2003
ACM
16 years 1 months ago
2003
ACM
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
121
Voted
QSHINE
2005
IEEE
15 years 6 months ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
125
Voted
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...