16404 search results - page 159 / 3281 » A set coverage problem |
127
click to vote
IPPS
2005
IEEE
15 years 9 months ago
2005
IEEE
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
101
click to vote
ICIP
2003
IEEE
16 years 5 months ago
2003
IEEE
The problem of finding the optimal set of quantized coefficients for a frame-based encoded signal is known to be of very high complexity. This paper presents an efficient method o...
154
click to vote
ALGORITHMICA
1998
15 years 3 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
104
click to vote
EJC
2010
15 years 3 months ago
2010
The paper contains a construction of a universal countable graph, different from the Rado graph, such that for any of its vertices both the neighbourhood and the non-neighbourhood ...
111
click to vote
IPL
2007
15 years 3 months ago
2007
We consider an integer-subset representation problem motivated by a medical application in radiation therapy. We prove NP-completeness, derive nontrivial bounds, and report on the...