نتایج جستجو برای: particle swarm optimisation

تعداد نتایج: 202321  

2010
Wang Yao Sheng Chen Lajos Hanzo

Bio-inspired computational methods have found wide-ranging applications in signal processing and other walks of engineering. In this contribution, particle swarm optimisation (PSO) is invoked for designing optimal multiuser transmission (MUT) schemes for multiple-input multiple-output communication. Specifically, we consider the minimum bit-error-rate (MBER) linear MUT using PSO and we design a...

2009
Volker Nissen Maik Günther

The current paper uses a scenario from logistics to show that modern heuristics, and in particular particle swarm optimization (PSO) can significantly add to the improvement of staff scheduling in practice. Rapid, sub-daily planning, which is the focus of our research offers considerable productivity reserves for companies but also creates complex challenges for the planning software.

2013
Lucie Daubigney Matthieu Geist Olivier Pietquin

Dialogue management optimisation has been cast into a planning under uncertainty problem for long. Some methods such as Reinforcement Learning (RL) are now part of the state of the art. Whatever the solving method, strong assumptions are made about the dialogue system properties. For instance, RL assumes that the dialogue state space is Markovian. Such constraints may involve important engineer...

Journal: :Evolutionary computation 2008
Spela Ivekovic Emanuele Trucco Yvan R. Petillot

In this paper we address the problem of human body pose estimation from still images. A multi-view set of images of a person sitting at a table is acquired and the pose estimated. Reliable and efficient pose estimation from still images represents an important part of more complex algorithms, such as tracking human body pose in a video sequence, where it can be used to automatically initialise ...

2014
Kalin Penev

Recent publications suggest that resolving multidimensional tasks where optimisation parameters are hundreds and more faces unusual computational limitation. In the same time optimisation algorithms, which perform well on tasks with low number of dimensions, when are applied to high dimensional tasks required infeasible period of time and computational resources. This article presents a novel i...

2010
Luca Mussi Spela Ivekovic Stefano Cagnoni

In this paper, we describe the GPU implementation of a markerless full-body articulated human motion tracking system from multi-view video sequences acquired in a studio environment. The tracking is formulated as a multidimensional nonlinear optimisation problem solved using particle swarm optimisation (PSO). We model the human body pose with a skeleton-driven subdivisionsurface human body mode...

2013
Luca Di Gaspero Andrea Schaerf Thomas Stützle Ramesh Sharda

We reconsider stochastic convergence analyses of particle swarm optimisation, and point out that previously obtained parameter conditions are not always sufficient to guarantee mean square convergence to a local optimum. We show that stagnation can in fact occur for non-trivial configurations in non-optimal parts of the search space, even for simple functions like SPHERE. The convergence proper...

Journal: :J. Parallel Distrib. Comput. 2011
Michal Czapinski Stuart Barnes

The introduction of NVidia’s powerful Tesla GPU hardware and Compute Unified Device Architecture (CUDA) platform enable many-core parallel programming. As a result, existing algorithms implemented on a GPU can run many times faster than on modern CPUs. Relatively little research has been done so far on GPU implementations of discrete optimisation algorithms. In this paper, two approaches to par...

2013
Hisham M. Soliman Magdi Sadek Mahmoud

In this paper, two new power system stabiliser (PSS) designs are proposed. The first one is based on a combined particle swarm optimisation (PSO) with linear matrix inequality (LMI) optimisation thereby improving previous existing results. The property of PSO of not sticking into a local minimum is used to eliminate the conservativeness of the design result utilising the static output feedback ...

Journal: :J. Applied Mathematics 2013
Jaco Fourie Richard D. Green Zong Woo Geem

Harmony search (HS) was introduced in 2001 as a heuristic population-based optimisation algorithm. Since then HS has become a popular alternative to other heuristic algorithms like simulated annealing and particle swarm optimisation. However, some flaws, like the need for parameter tuning, were identified and have been a topic of study for much research over the last 10 years. Many variants of ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید