520 search results - page 61 / 104 » New Complexity Results for Classical Planning Benchmarks |
CRV
2005
IEEE
14 years 2 months ago
2005
IEEE
The extraction of optimal features, in a classification sense, is still quite challenging in the context of large-scale classification problems (such as visual recognition), inv...
FORTE
2004
13 years 9 months ago
2004
Internet software tightly integrates classic computation with communication software. Heterogeneity and complexity can be tackled with a component-based approach, where components ...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
DCC
2011
IEEE
13 years 3 months ago
2011
IEEE
We show that (n, 2n ) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to ...
SAB
2004
Springer
14 years 1 months ago
2004
Springer
While techniques exist for simulating swarming behaviors, these methods usually provide only simplistic navigation and planning capabilities. In this review, we explore the benefi...