2796 search results - page 295 / 560 » The coolest path problem |
143
click to vote
HPDC
1997
IEEE
15 years 10 months ago
1997
IEEE
Layering of protocols o ers several well-known advantages, but typically leads to performance ine ciencies. We present a model for layering, and point out where the performance pr...
168
click to vote
APNOMS
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we propose the localized adaptive QoS routing scheme using POMDP(partially observable Markov Decision Processes) and Exploration Bonus. In order to deal with POMDP p...
147
Voted
IMAGING
2004
15 years 8 months ago
2004
In imaging applications, computation is often carried out in a derivative (gradient) domain. For example, we can attenuate small image differences by thresholding the gradient and...
188
click to vote
MOBIHOC
2007
ACM
16 years 6 months ago
2007
ACM
We address the problem of balancing the traffic load in multi-hop wireless networks. We consider a point-to-point communicating network with a uniform distribution of source-sink ...
181
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...