Sciweavers

1550 search results - page 95 / 310
» Optimizing search by showing results in context
Sort
View
LSSC
2007
Springer
14 years 3 months ago
Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem
The Ant Colony Optimization (ACO) algorithms are being applied successfully to a wide range of problems. ACO algorithms could be good alternatives to existing algorithms for hard c...
Stefka Fidanova
HAIS
2009
Springer
14 years 1 months ago
Hybrid Evolutionary Algorithm for Solving Global Optimization Problems
Differential Evolution (DE) is a novel evolutionary approach capable of handling non-differentiable, non-linear and multi-modal objective functions. DE has been consistently ranked...
Radha Thangaraj, Millie Pant, Ajith Abraham, Youak...
AAAI
2004
13 years 10 months ago
Branching and Pruning: An Optimal Temporal POCL Planner Based on Constraint Programming
A key feature of modern optimal planners such as Graphplan and Blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planne...
Vincent Vidal, Hector Geffner
ATAL
2009
Springer
14 years 3 months ago
Caching schemes for DCOP search algorithms
Distributed Constraint Optimization (DCOP) is useful for solving agent-coordination problems. Any-space DCOP search algorithms require only a small amount of memory but can be spe...
William Yeoh, Pradeep Varakantham, Sven Koenig
ICMLA
2004
13 years 10 months ago
A new discrete binary particle swarm optimization based on learning automata
: The particle swarm is one of the most powerful methods for solving global optimization problems. This method is an adaptive algorithm based on social-psychological metaphor. A po...
Reza Rastegar, Mohammad Reza Meybodi, Kambiz Badie