Sciweavers

1093 search results - page 63 / 219
» Probabilistic Location and Routing
Sort
View
IPPS
2003
IEEE
14 years 1 months ago
BLAM : A High-Performance Routing Algorithm for Virtual Cut-Through Networks
High performance, freedom from deadlocks, and freedom from livelocks are desirable properties of interconnection networks. Unfortunately, these can be conflicting goals because n...
Mithuna Thottethodi, Alvin R. Lebeck, Shubhendu S....
ICC
2011
IEEE
272views Communications» more  ICC 2011»
12 years 8 months ago
Dynamic Anycast Routing and Wavelength Assignment in WDM Networks Using Ant Colony Optimization (ACO)
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
Kavitha Bhaskaran, Joan Triay, Vinod Vokkarane
OOPSLA
2007
Springer
14 years 2 months ago
Probabilistic calling context
Calling context enhances program understanding and dynamic analyses by providing a rich representation of program location. Compared to imperative programs, objectoriented program...
Michael D. Bond, Kathryn S. McKinley
EDBT
2010
ACM
185views Database» more  EDBT 2010»
13 years 10 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen
ICDE
2009
IEEE
148views Database» more  ICDE 2009»
14 years 10 months ago
Probabilistic Inference over RFID Streams in Mobile Environments
Abstract-- Recent innovations in RFID technology are enabling large-scale cost-effective deployments in retail, healthcare, pharmaceuticals and supply chain management. The advent ...
Thanh Tran 0002, Charles Sutton, Richard Cocci, Ya...