1331 search results - page 144 / 267 » Complexity bounds for zero-test algorithms |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
105
click to vote
TCOM
2010
14 years 8 months ago
2010
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....
105
click to vote
WALCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
101
click to vote
ISAAC
2010
Springer
14 years 8 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
PIMRC
2010
IEEE
14 years 7 months ago
2010
IEEE
This study addresses the general problem of efficient resource management in wireless networks with arbitrary timevarying topologies. Communication channels are assumed to generall...