Sciweavers

1833 search results - page 84 / 367
» A Matrix-Based Approach to the Global Locality Optimization ...
Sort
View
127
Voted
CEC
2005
IEEE
15 years 9 months ago
Genetic algorithms with self-organized criticality for dynamic optimization problems
This paper proposes a genetic algorithm (GA) with random immigrants for dynamic optimization problems where the worst individual and its neighbours are replaced every generation. I...
Renato Tinós, Shengxiang Yang
138
Voted
IAT
2005
IEEE
15 years 9 months ago
Decomposition Techniques for a Loosely-Coupled Resource Allocation Problem
We are interested by contributing to stochastic problems of which the main distinction is that some tasks may create other tasks. In particular, we present a first approach which...
Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak...
133
Voted
CEC
2008
IEEE
15 years 10 months ago
Differential evolution for discrete optimization: An experimental study on Combinatorial Auction problems
: Differential evolutionary (DE) mutates solution vectors by the weighted difference of other vectors using arithmetic operations. As these operations cannot be directly extended t...
Jingqiao Zhang, Viswanath Avasarala, Arthur C. San...
146
Voted
ICCAD
2007
IEEE
281views Hardware» more  ICCAD 2007»
16 years 12 days ago
Archer: a history-driven global routing algorithm
Global routing is an important step in the physical design process. In this paper, we propose a new global routing algorithm Archer, which resolves some of the most common problem...
Muhammet Mustafa Ozdal, Martin D. F. Wong
176
Voted
PR
2007
139views more  PR 2007»
15 years 3 months ago
Learning the kernel matrix by maximizing a KFD-based class separability criterion
The advantage of a kernel method often depends critically on a proper choice of the kernel function. A promising approach is to learn the kernel from data automatically. In this p...
Dit-Yan Yeung, Hong Chang, Guang Dai