Sciweavers

157 search results - page 22 / 32
» Randomized Algorithms for Minimum Distance Localization
Sort
View
MOBICOM
2003
ACM
14 years 1 months ago
Range-free localization schemes for large scale sensor networks
Wireless Sensor Networks have been proposed for a multitude of location-dependent applications. For such systems, the cost and limitations of the hardware on sensing nodes prevent...
Tian He, Chengdu Huang, Brian M. Blum, John A. Sta...
EOR
2006
118views more  EOR 2006»
13 years 7 months ago
A random-key genetic algorithm for the generalized traveling salesman problem
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
Lawrence V. Snyder, Mark S. Daskin
ICIP
2000
IEEE
14 years 9 months ago
Texture-Based Segmentation of Satellite Weather Imagery
Unsupervised segmentation of weather images into features that correspond to physical storms is a fundamental and difficult problem. Treating an infrared satellite image as a Mark...
V. Lakshmanan, Victor E. DeBrunner, R. Rabin
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
13 years 9 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
COR
2010
146views more  COR 2010»
13 years 8 months ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz