Sciweavers

1433 search results - page 83 / 287
» On Covering Problems of Rado
Sort
View
FM
2006
Springer
127views Formal Methods» more  FM 2006»
15 years 10 months ago
Using Domain-Independent Problems for Introducing Formal Methods
Abstract. The key to the integration of formal methods into engineering practice is education. In teaching, domain-independent problems -i.e., not requiring prior engineering backg...
Raymond T. Boute
173
Voted
COMCOM
2006
150views more  COMCOM 2006»
15 years 6 months 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
JGAA
2000
179views more  JGAA 2000»
15 years 6 months 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
4OR
2008
115views more  4OR 2008»
15 years 5 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...
ICRA
2008
IEEE
125views Robotics» more  ICRA 2008»
16 years 1 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 ...