3370 search results - page 435 / 674 » Adding Networks |
161
click to vote
IWCMC
2009
ACM
15 years 11 months ago
2009
ACM
We consider the problem of scheduling emergency responders to geospatially located finite duration temporally bounded tasks. We consider two different schedulers, Greedy and Mee...
159
click to vote
SIGIR
2004
ACM
16 years 1 hour ago
2004
ACM
Optimizing and focusing search and results ranking in P2P networks becomes more and more important with the increasing size of these networks. Even though a few approaches have al...
158
click to vote
COMCOM
2007
15 years 6 months ago
2007
Minimum interference routing schemes are good options for achieving fewer working-path request rejections. They improve the vast majority of the current QoS routing proposals. How...
161
click to vote
APSCC
2008
IEEE
16 years 1 months ago
2008
IEEE
—Vehicular ad hoc network protocol with hybrid relay architecture is proposed for improving the success ratio. Access gateway estimation and a probability table based on the rout...
192
click to vote
COLOGNETWENTE
2007
15 years 8 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...