Titlebook: Swarm Intelligence; 7th International Co Marco Dorigo,Mauro Birattari,Thomas Stützle Conference proceedings 2010 Springer-Verlag Berlin Hei

LEVER

Infant

厭惡

Antbots: A Feasible Visual Emulation of Pheromone Trails for Swarm Robotsient pathfinding between nest and potential food sources. Experimental results show that our trail and sun compass add-on boards are accurate enough to allow a single robot to lay and follow a trail repeatedly.

PHON

沒(méi)有希望

A Modified Particle Swarm Optimization Algorithm for the Best Low Multilinear Rank Approximation of e best low multilinear rank approximation of a given tensor. This problem has been formulated as an optimization problem over the Grassmann manifold [14] and it has been shown that the objective function presents multiple minima [15]. In order to investigate the landscape of this cost function, we p

PUT

A Robotic Validation of the Attractive Field Model: An Inter-disciplinary Model of Self-regulatory S using a set of previously published generic rules for division of labour derived from the observation of ant, human and robotic social systems. These bottom-up rules describe the phenomenon of self-regulated division of labour in terms of attractive fields between robots and tasks. The concrete for

流動(dòng)才波動(dòng)

軟膏

An Alternative ACO, Algorithm for Continuous Optimization Problemsn problems. Although ACO practitioners have a long tradition in solving combinatorial optimization problems, many other researchers have recently developed a variety of ACO algorithms for dealing with continuous optimization problems. One of these algorithms is the so-called ACO., which is one of th

持久

An Efficient Optimization Method for Revealing Local Optima of Projection Pursuit Indicesstructures, such as possible groups or outliers, by optimizing a function called projection index. To determine these possible interesting structures, it is necessary to choose an optimization method capable to find not only the global optimum of the projection index but also the local optima suscep

characteristic

Ant Colony Optimisation for Ligand Dockinghe approach treats the placement of a ligand molecule in the protein’s binding site as a discrete assignment problem and a geometric point fitting procedure generates protein-ligand complex conformations from this representation. As in PLANTS [5,6], we combine this approach with a local search in th