Sciweavers

820 search results - page 105 / 164
» A Search Algorithm for Global Optimisation
Sort
View
ICMLA
2004
15 years 4 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
NIPS
2003
15 years 4 months ago
Ranking on Data Manifolds
The Google search engine has enjoyed huge success with its web page ranking algorithm, which exploits global, rather than local, hyperlink structure of the web using random walks....
Dengyong Zhou, Jason Weston, Arthur Gretton, Olivi...
CONSTRAINTS
2007
93views more  CONSTRAINTS 2007»
15 years 3 months ago
Arc-B-consistency of the Inter-distance Constraint
We study the “inter-distance constraint”, also known as the global minimum distance constraint, that ensures that the distance between any pair of variables is at least equal ...
Konstantin Artiouchine, Philippe Baptiste
JEI
2006
82views more  JEI 2006»
15 years 3 months ago
Real-time mosaic using sequential graph
To prevent large error accumulation in multiple image registration considering real-time applications, we propose a new fast global mosaic method using sequential block matching in...
Dae Woong Kim, Ki-Sang Hong
ANTSW
2008
Springer
15 years 5 months ago
Adaptive Particle Swarm Optimization
An adaptive particle swarm optimization (APSO) that features better search efficiency than classical particle swarm optimization (PSO) is presented. More importantly, it can perfor...
Zhi-hui Zhan, Jun Zhang