Sciweavers

895 search results - page 49 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
81
Voted
SAT
2007
Springer
146views Hardware» more  SAT 2007»
15 years 5 months ago
Algorithms for Variable-Weighted 2-SAT and Dual Problems
Abstract. In this paper we study NP-hard weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...
Stefan Porschen, Ewald Speckenmeyer
93
Voted
HAIS
2009
Springer
15 years 3 months ago
Automatic Clustering Using a Synergy of Genetic Algorithm and Multi-objective Differential Evolution
— This paper applies the Differential Evolution (DE) and Genetic Algorithm (GA) to the task of automatic fuzzy clustering in a Multi-objective Optimization (MO) framework. It com...
Debarati Kundu, Kaushik Suresh, Sayan Ghosh, Swaga...
72
Voted
EVOW
2010
Springer
15 years 5 months ago
A Directed Mutation Operator for Real Coded Genetic Algorithms
Abstract. Developing directed mutation methods has been an interesting research topic to improve the performance of genetic algorithms (GAs) for function optimization. This paper i...
Imtiaz Korejo, Shengxiang Yang, Changhe Li
79
Voted
FAW
2008
Springer
104views Algorithms» more  FAW 2008»
15 years 20 days ago
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
Michael Dom, Somnath Sikdar
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 5 months ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...