1424 search results - page 72 / 285 » The Multi-radius Cover Problem |
112
click to vote
ALGOSENSORS
2006
Springer
15 years 6 months ago
2006
Springer
: We consider the broadcasting problem in sensor networks where the nodes have no prior knowledge of their neighbourhood. We describe several Area-based Beaconless Broadcasting Alg...
128
click to vote
CCGRID
2003
IEEE
15 years 8 months ago
2003
IEEE
Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with...
112
click to vote
IPCO
2001
15 years 4 months ago
2001
The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating ...
117
Voted
JCT
2008
15 years 2 months ago
2008
If a Steiner system S(4, 5, 17) exists, it would contain derived S(3, 4, 16) designs. By relying on a recent classification of the S(3, 4, 16), an exhaustive computer search for S...
114
click to vote
KDD
2008
ACM
16 years 3 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...