1225 search results - page 35 / 245 » The Instance Complexity Conjecture |
136
Voted
CADE
2008
Springer
16 years 3 months ago
2008
Springer
Abstract. Conjunctive query answering plays a prominent role in applications of description logics (DLs) that involve instance data, but its exact complexity was a long-standing op...
101
Voted
FCS
2007
15 years 4 months ago
2007
Instances of the futile questioning problem abound in applications, especially, in the area of artificial intelligence. The problem can be represented by a particular quantified ...
101
Voted
ENDM
2010
15 years 2 months ago
2010
Deciding whether an arbitrary graph admits a VLSI layout with unit-length edges is NP-complete [1], even when restricted to binary trees [7]. However, for certain graphs, the prob...
103
Voted
CEC
2005
IEEE
15 years 8 months ago
2005
IEEE
We consider the (1+λ) evolution strategy, an evolutionary algorithm for minimization in Rn , using isotropic mutations. Thus, for instance, Gaussian mutations adapted by the 1/5-r...
112
Voted
ICRA
2003
IEEE
15 years 8 months ago
2003
IEEE
— Important theoretical aspects of multi-robot coordination mechanisms have, to date, been largely ignored. To address part of this negligence, we focus on the problem of multi-r...