Sciweavers

1424 search results - page 77 / 285
» The Multi-radius Cover Problem
Sort
View
COMCOM
2006
150views more  COMCOM 2006»
15 years 26 days ago
Energy-efficient coverage problems in wireless ad-hoc sensor networks
Wireless sensor networks constitute the platform of a broad range of applications related to national security, surveillance, military, health care, and environmental monitoring. ...
Mihaela Cardei, Jie Wu
112
Voted
JGAA
2000
179views more  JGAA 2000»
15 years 18 days ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
136
Voted
4OR
2008
115views more  4OR 2008»
14 years 11 months ago
A branch-and-price algorithm for the two-dimensional level strip packing problem
The two-dimensional level strip packing problem (2LSPP) consists in packing rectangular items of given size into a strip of given width divided into levels. Items packed into the ...
Andrea Bettinelli, Alberto Ceselli, Giovanni Righi...
89
Voted
ICRA
2008
IEEE
125views Robotics» more  ICRA 2008»
15 years 7 months ago
An approximation algorithm for the least overlapping p-Frame problem with non-partial coverage for networked robotic cameras
Abstract— We report our algorithmic development of the pframe problem that addresses the need of coordinating a set of p networked robotic pan-tilt-zoom cameras for n, (n > p)...
Yiliang Xu, Dezhen Song, Jingang Yi, A. Frank van ...
95
Voted
GECCO
2007
Springer
161views Optimization» more  GECCO 2007»
15 years 7 months ago
Alternative techniques to solve hard multi-objective optimization problems
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
Ricardo Landa Becerra, Carlos A. Coello Coello, Al...