1450 search results - page 41 / 290 » On the Complexity of Hardness Amplification |
AIPS
2006
13 years 9 months ago
2006
The 3rd and 4th International Planning Competitions have enriched the set of benchmarks for classical propositional planning by a number of novel and interesting planning domains....
AAAI
1994
13 years 9 months ago
1994
This paper presents a novel approach to diagnosis which addresses the two problems - computational complexity of abduction and device models - that have prevented model-based diag...
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. What is information? Frequently spoken about in many contexts, yet nobody has ever been able to define it with mathematical rigor. The best we are left with so far is th...
CCA
2009
Springer
14 years 2 months ago
2009
Springer
d Abstract) Robert Rettinger1 Department of Mathematics and Computer Science University of Hagen, Germany Abstract. We show that under reasonable assumptions there exist Riemann ma...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...