1450 search results - page 101 / 290 » On the Complexity of Hardness Amplification |
DLOG
2009
13 years 7 months ago
2009
Abstract. TBox reasoning in description logics is hard. For example, reasoning in SROIQ (i.e. OWL2-DL) is N2EXPTIME-complete; even with R, a fragment of SROIQ supporting ALC GCIs a...
IAJIT
2011
13 years 4 months ago
2011
: User interfaces have special characteristics that differentiate them from the rest of the software code. Typical software metrics that indicate its complexity and quality may not...
ECBS
2011
IEEE
12 years 9 months ago
2011
IEEE
—Developing dependable distributed real-time and embedded (DRE) systems incurs significant complexities in the tradeoffs resulting from the different conflicting attributes of ...
ALT
2006
Springer
14 years 6 months ago
2006
Springer
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
IJRR
2010
13 years 7 months ago
2010
This paper explores a topological perspective of planning in the presence of uncertainty, focusing on tasks specified by goal states in discrete spaces. The paper introduces stra...