3415 search results - page 467 / 683 » Lower bounds on kernelization |
188
click to vote
COMPGEOM
1995
ACM
15 years 10 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
159
click to vote
WDAG
2000
Springer
15 years 10 months ago
2000
Springer
This paper presents a study of a distributed cooperation problem under the assumption that processors may not be able to communicate for a prolonged time. The problem for n proces...
165
click to vote
SPAA
1995
ACM
15 years 10 months ago
1995
ACM
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
217
click to vote
AAAI
2008
15 years 8 months ago
2008
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
176
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...