1433 search results - page 79 / 287 » On Covering Problems of Rado |
145
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
While the covering algorithm has been perfected recently by the iterative approaches, such as DAOmap and IMap, its application has been limited to technology mapping. The main fact...
157
click to vote
IJSNET
2006
15 years 6 months ago
2006
Abstract: This paper addresses the target coverage problem in wireless sensor networks with adjustable sensing range. Communication and sensing consume energy, therefore efficient ...
153
click to vote
ICWL
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The paper describes a complex e-learning experiment that has involved over 700 students that attended the Human-Computer Interaction course at the "Politehnica"...
155
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
170
click to vote
COR
2007
15 years 6 months ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...