1208 search results - page 29 / 242 » Uniform eventown problems |
WDAG
2010
Springer
14 years 10 months ago
2010
Springer
Leader election and arbitrary pattern formation are fundammental tasks for a set of autonomous mobile robots. The former consists in distinguishing a unique robot, called the lead...
198
click to vote
ICDE
2001
IEEE
16 years 1 months ago
2001
IEEE
We study the problem of approximately answering aggregation queries using sampling. We observe that uniform sampling performs poorly when the distribution of the aggregated attrib...
AAAI
1990
15 years 25 days ago
1990
Recently, conditional logics have been developed for application to problems in default reasoning. We present a uniform framework for the development and investigation of conditio...
140
click to vote
TAPAS
2011
14 years 6 months ago
2011
We study upper and lower bounds on the kernel size for the 3-hitting set problem on hypergraphs of degree at most 3, denoted 33-hs. We first show that, unless P=NP, 3-3-hs on 3-un...
122
click to vote
WADS
2007
Springer
15 years 5 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...