1155 search results - page 126 / 231 » Continuous dynamic problem generators for evolutionary algor... |
120
click to vote
CEC
2003
IEEE
15 years 8 months ago
2003
IEEE
Although many methods for dealing with multi-objective optimisation (MOO) problems are available [Deb01] and successful applications have been reported [Coe01], the comparison betw...
124
click to vote
ECRTS
1999
IEEE
15 years 7 months ago
1999
IEEE
Despite the significant body of results in real-time scheduling, many real world problems are not easily supported. While algorithms such as Earliest Deadline First, Rate Monotoni...
129
click to vote
CEC
2010
IEEE
15 years 4 months ago
2010
IEEE
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
127
click to vote
CP
2006
Springer
15 years 6 months ago
2006
Springer
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
109
click to vote
ICCAD
2006
IEEE
15 years 12 months ago
2006
IEEE
High power consumption will shorten battery life for handheld devices and cause thermal and reliability problems. One way to lower the dynamic power consumption is to reduce the s...