914 search results - page 84 / 183 » Branch and Bound on the Network Model |
144
click to vote
SIGAL
1990
15 years 1 months ago
1990
We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading"). In the classical mode...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
INFOCOM
2012
IEEE
13 years 7 days ago
2012
IEEE
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
CONEXT
2006
ACM
15 years 3 months ago
2006
ACM
In First Person Shooter (FPS) games the Round Trip Time (RTT), i.e., the sum of the network delay from client to server and the network delay from server to client, impacts the ga...
107
click to vote
WIOPT
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract—Delay-reliability (D-R), and throughput-delayreliability (T-D-R) tradeoffs in an ad hoc network are derived for single hop and multi-hop transmission with automatic repe...