2542 search results - page 507 / 509 » Computing Cartograms with Optimal Complexity |
IJON
2007
13 years 7 months ago
2007
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
TCS
2008
13 years 7 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
JALC
2007
13 years 7 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
BMCBI
2004
13 years 7 months ago
2004
Background: The general problem of RNA secondary structure prediction under the widely used thermodynamic model is known to be NP-complete when the structures considered include a...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Social insect societies and more specifically ant colonies, are distributed systems that, in spite of the simplicity of their individuals, present a highly structured social organi...