Sciweavers

217 search results - page 13 / 44
» Approximating Minimum Manhattan Networks
Sort
View
ALENEX
2001
101views Algorithms» more  ALENEX 2001»
13 years 11 months ago
CNOP - A Package for Constrained Network Optimization
Abstract. We present a generic package for resource constrained network optimization problems. We illustrate the flexibility and the use of our package by solving four applications...
Kurt Mehlhorn, Mark Ziegelmann
IAT
2008
IEEE
14 years 4 months ago
Finding Minimum Data Requirements Using Pseudo-independence
In situations where Bayesian networks (BN) inferencing approximation is allowable, we show how to reduce the amount of sensory observations necessary and in a multi-agent context ...
Yoonheui Kim, Victor R. Lesser
TON
2010
197views more  TON 2010»
13 years 8 months ago
Constrained relay node placement in wireless sensor networks: formulation and approximations
—One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stati...
Satyajayant Misra, Seung Don Hong, Guoliang Xue, J...
ANOR
2007
80views more  ANOR 2007»
13 years 10 months ago
The minimum shift design problem
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
Luca Di Gaspero, Johannes Gärtner, Guy Kortsa...
NETWORKING
2007
13 years 11 months ago
Location-Unaware Sensing Range Assignment in Sensor Networks
We study field-monitoring applications in which sensors are deployed in large numbers and the sensing process is expensive. In such applications, nodes should use the minimum poss...
Ossama Younis, Srinivasan Ramasubramanian, Marwan ...