2412 search results - page 53 / 483 » Which Problems Have Strongly Exponential Complexity |
ESANN
2001
13 years 11 months ago
2001
: Many researchers are interesting in applying the neural networks methods to financial data. In fact these data are very complex, and classical methods do not always give satisfac...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
Evolution of neural networks, as implemented in NEAT, has proven itself successful on a variety of low-level control problems such as pole balancing and vehicle control. Nonethele...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
MST
2008
13 years 10 months ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...