Sciweavers

2266 search results - page 218 / 454
» Evolutionary Algorithms for the Satisfiability Problem
Sort
View
GECCO
2010
Springer
127views Optimization» more  GECCO 2010»
15 years 1 months ago
Set-based multi-objective optimization, indicators, and deteriorative cycles
Evolutionary multi-objective optimization deals with the task of computing a minimal set of search points according to a given set of objective functions. The task has been made e...
Rudolf Berghammer, Tobias Friedrich, Frank Neumann
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
15 years 4 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
JAR
2000
145views more  JAR 2000»
15 years 2 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro
ECML
2007
Springer
15 years 9 months ago
Multi-objective Genetic Programming for Multiple Instance Learning
Abstract. This paper introduces the use of multi-objective evolutionary algorithms in multiple instance learning. In order to achieve this purpose, a multi-objective grammar-guided...
Amelia Zafra, Sebastián Ventura
AAAI
2010
15 years 1 months ago
Latent Class Models for Algorithm Portfolio Methods
Different solvers for computationally difficult problems such as satisfiability (SAT) perform best on different instances. Algorithm portfolios exploit this phenomenon by predicti...
Bryan Silverthorn, Risto Miikkulainen