454 search results - page 10 / 91 » On improving approximate solutions by evolutionary algorithm... |
143
Voted
FSTTCS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
133
Voted
EC
2002
15 years 3 months ago
2002
Over the past few years, the research on evolutionary algorithms has demonstrated their niche in solving multiobjective optimization problems, where the goal is to nd a number of ...
165
Voted
SODA
2010
ACM
16 years 24 days ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
168
Voted
PPSN
2010
Springer
15 years 1 months ago
2010
Springer
Existing privacy-preserving evolutionary algorithms are limited to specific problems securing only cost function evaluation. This lack of functionality and security prevents thei...
103
click to vote
CIG
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract- In this paper, we apply an Evolutionary Algorithm (EA) to solve the Rubinstein’s Basic AlternatingOffer Bargaining Problem, and compare our experimental results with it...