3600 search results - page 400 / 720 » The settling-time reducibility ordering |
171
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—We investigate the construction of greedy embeddings in polylogarithmic dimensional Euclidian spaces in order to achieve scalable routing through geographic routing. We ...
177
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—In this paper, we investigate into optimal admission control policies for Heterogeneous Wireless Networks (HWN), considering an integration of wireless mesh networks with an ove...
212
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—We investigate an architecture for multi-Gigabit outdoor mesh networks operating in the unlicensed 60 GHz “millimeter (mm) wave” band. In this band, the use of narrow beams ...
183
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
Partitioned Global Address Space (PGAS) languages provide a unique programming model that can span shared-memory multiprocessor (SMP) architectures, distributed memory machines, o...
151
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...