Sciweavers

381 search results - page 19 / 77
» Time Complexity of genetic algorithms on exponentially scale...
Sort
View
GECCO
2005
Springer
102views Optimization» more  GECCO 2005»
14 years 1 months ago
Latent variable crossover for k-tablet structures and its application to lens design problems
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...
Jun Sakuma, Shigenobu Kobayashi
CIMCA
2008
IEEE
14 years 2 months ago
LGR: The New Genetic Based Scheduler for Grid Computing Systems
—The computational grid provides a promising platform for the deployment of various high-performance computing applications. In computational grid, an efficient scheduling of tas...
Leili Mohammad Khanli, Seyad Naser Razavi, Nima Ja...
PODC
2009
ACM
14 years 8 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
ICICIC
2006
IEEE
14 years 1 months ago
An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
Pan Junjie, Wang Dingwei
NIPS
2003
13 years 9 months ago
Convex Methods for Transduction
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
Tijl De Bie, Nello Cristianini