Sciweavers

14518 search results - page 229 / 2904
» Two Problems for Sophistication
Sort
View
95
Voted
TSE
2011
111views more  TSE 2011»
14 years 7 months ago
Software Module Clustering as a Multi-Objective Search Problem
Software module clustering is the problem of automatically organising software units into modules to improve program structure. There has been a great deal of recent interest in s...
Kata Praditwong, Mark Harman, Xin Yao
88
Voted
ICASSP
2011
IEEE
14 years 4 months ago
Analysis of unknown velocity and target off the grid problems in compressive sensing based subsurface imaging
Sparsity of target space in subsurface imaging problem is used within the framework of the compressive sensing (CS) theory in recent publications to decrease the data acquisition ...
Mehmet Ali Çagri Tuncer, Ali Cafer Gurbuz
CEC
2007
IEEE
15 years 7 months ago
Comparing bio-inspired algorithms in constrained optimization problems
Abstract— This paper presents a comparison of four bioinspired algorithms (all seen as search engines) with a similar constraint-handling mechanism (Deb’s feasibility rules) to...
Efrén Mezura-Montes, Blanca Cecilia Lopez-R...
CEC
2007
IEEE
15 years 7 months ago
Continuous dynamic problem generators for evolutionary algorithms
— Addressing dynamic optimization problems has attracted a growing interest from the evolutionary algorithm community in recent years due to its importance in the applications of...
Renato Tinós, Shengxiang Yang
95
Voted
SOFSEM
2007
Springer
15 years 6 months ago
On Optimal Solutions for the Bottleneck Tower of Hanoi Problem
We study two aspects of a generalization of the Tower of Hanoi puzzle. In 1981, D. Wood suggested its variant, where a bigger disk may be placed higher than a smaller one if their ...
Yefim Dinitz, Shay Solomon