Sciweavers

1215 search results - page 83 / 243
» Application domain study of evolutionary algorithms in optim...
Sort
View
AMAI
2000
Springer
15 years 5 months ago
On Solving Boolean Optimization with Satisfiability-Based Algorithms
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
Vasco M. Manquinho, João P. Marques Silva
ESANN
2004
15 years 2 months ago
Evolutionary tuning of multiple SVM parameters
The problem of model selection for support vector machines (SVMs) is considered. We propose an evolutionary approach to determine multiple SVM hyperparameters: The covariance matr...
Frauke Friedrichs, Christian Igel
ISICA
2007
Springer
15 years 7 months ago
Fast Multi-swarm Optimization with Cauchy Mutation and Crossover Operation
The standard Particle Swarm Optimization (PSO) algorithm is a novel evolutionary algorithm in which each particle studies its own previous best solution and the group’s previous ...
Qing Zhang, Changhe Li, Yong Liu, Lishan Kang
IPCO
2001
184views Optimization» more  IPCO 2001»
15 years 2 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
EVOW
2007
Springer
15 years 5 months ago
Evaluation of Different Metaheuristics Solving the RND Problem
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...