Sciweavers

16404 search results - page 257 / 3281
» A set coverage problem
Sort
View
INFOCOM
2005
IEEE
15 years 10 months ago
SMART: a scan-based movement-assisted sensor deployment method in wireless sensor networks
— The efficiency of sensor networks depends on the coverage of the monitoring area. Although in general a sufficient number of sensors are used to ensure a certain degree of re...
Jie Wu, Shuhui Yang
ALGORITHMICA
2010
143views more  ALGORITHMICA 2010»
15 years 4 months ago
Absolute and Asymptotic Bounds for Online Frequency Allocation in Cellular Networks
Given a cellular (mobile telephone) network, whose geographical coverage area is divided into hexagonal cells, phone calls are serviced by assigning frequencies to them so that no...
Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye,...
COCOON
2006
Springer
15 years 8 months ago
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
Marc Benkert, Joachim Gudmundsson, Christian Knaue...
ENDM
2010
126views more  ENDM 2010»
15 years 4 months ago
A 0/1 Integer Programming Model for the Office Space Allocation Problem
We propose a 0/1 integer programming model to tackle the office space allocation (OSA) problem which refers to assigning room space to a set of entities (people, machines, roles, ...
Özgür Ülker, Dario Landa-Silva
MOR
2006
95views more  MOR 2006»
15 years 4 months ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege