1301 search results - page 197 / 261 » Bounded Version Vectors |
IPCCC
2007
IEEE
14 years 4 months ago
2007
IEEE
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
AAIM
2007
Springer
14 years 4 months ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
EUROCRYPT
2007
Springer
14 years 4 months ago
2007
Springer
We study conditional computational entropy: the amount of randomness a distribution appears to have to a computationally bounded observer who is given some correlated information....
STACS
2007
Springer
14 years 4 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
WADS
2007
Springer
14 years 4 months ago
2007
Springer
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs’...