294 search results - page 45 / 59 » A hybrid metaheuristic approach to solving the UBQP problem |
GECCO
2003
Springer
14 years 24 days ago
2003
Springer
In this paper, we revisit a general class of multi-criteria multi-constrained network design problems and attempt to solve, in a novel way, with Evolutionary Algorithms (EAs). A ma...
AAAI
2006
13 years 9 months ago
2006
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
The problem under study here is the minimax design of linearphase lowpass FIR filters having variable passband width and implemented through a Farrow structure. We have two main ...
CPAIOR
2006
Springer
13 years 11 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
SIBGRAPI
2005
IEEE
14 years 1 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...