Sciweavers

604 search results - page 84 / 121
» The Hardness of Metric Labeling
Sort
View
MOBIHOC
2002
ACM
14 years 7 months ago
Minimum energy paths for reliable communication in multi-hop wireless networks
Current algorithms for minimum-energy routing in wireless networks typically select minimum-cost multi-hop paths. In scenarios where the transmission power is fixed, each link has...
Suman Banerjee, Archan Misra
IPSN
2009
Springer
14 years 2 months ago
Distributed resource management and matching in sensor networks
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
INFOCOM
2009
IEEE
14 years 2 months ago
An Evaluation of Weak State Mechanism Design for Indirection in Dynamic Networks
—State signaling and maintenance mechanisms play crucial roles in communication network protocols. State is used to facilitate indirections in protocols such as routing. Design a...
Utku Gunay Acer, Alhussein A. Abouzeid, Shivkumar ...
ESA
2009
Springer
124views Algorithms» more  ESA 2009»
14 years 2 months ago
Minimum Makespan Multi-vehicle Dial-a-Ride
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi
ATAL
2007
Springer
14 years 2 months ago
Learning consumer preferences using semantic similarity
In online, dynamic environments, the services requested by consumers may not be readily served by the providers. This requires the service consumers and providers to negotiate the...
Reyhan Aydogan, Pinar Yolum