On the Complexity of Optimization Problems based on Compiled NNF Representations.
Daniel Le BerreEmmanuel LoncaPierre MarquisPublished in: CoRR (2014)
Keyphrases
- optimization problems
- evolutionary algorithm
- cost function
- combinatorial optimization
- optimization methods
- normal form
- traveling salesman problem
- upper bound
- hidden markov models
- optimization criteria
- metaheuristic
- higher level
- real time
- computational complexity
- multiscale
- website
- decision making
- information retrieval
- neural network
- databases