Sciweavers

1453 search results - page 45 / 291
» A globally optimal algorithm for TTD-MDPs
Sort
View
CEC
2009
IEEE
14 years 2 months ago
A clustering particle swarm optimizer for dynamic optimization
Abstract—In the real world, many applications are nonstationary optimization problems. This requires that optimization algorithms need to not only find the global optimal soluti...
Changhe Li, Shengxiang Yang
DEXAW
2008
IEEE
204views Database» more  DEXAW 2008»
14 years 2 months ago
Particle Swarm Optimization Using Adaptive Mutation
Two new variants of Particle Swarm Optimization (PSO) called AMPSO1 and AMPSO2 are proposed for global optimization problems. Both the algorithms use adaptive mutation using Beta ...
Millie Pant, Radha Thangaraj, Ajith Abraham
EVOW
2009
Springer
14 years 2 months ago
Discrete Particle Swarm Optimization for Multiple Destination Routing Problems
This paper proposes a discrete particle swarm optimization (DPSO) to solve the multiple destination routing (MDR) problems. The problem has been proven to be NP-complete and the tr...
Zhi-hui Zhan, Jun Zhang
AI
2011
Springer
13 years 2 months ago
The extended global cardinality constraint: An empirical survey
The Extended Global Cardinality Constraint (EGCC) is a vital component of constraint solving systems, since it is very widely used to model diverse problems. The literature contai...
Peter Nightingale
RTS
2011
176views more  RTS 2011»
12 years 10 months ago
Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
This paper is an extended version of a paper that appeared in the proceedings of the IEEE Real-Time Systems Symposium 2009. This paper has been updated with respect to advances ma...
Robert I. Davis, Alan Burns