10718 search results - page 344 / 2144 » On the Circuit Implementation Problem |
207
click to vote
ANTSW
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
180
click to vote
PDP
2003
IEEE
16 years 19 hour ago
2003
IEEE
The paper presents a Coarse-Grained Multicomputer algorithm that solves the Longest Common Subsequence Problem. This algorithm can be implemented in the CGM with È processors in ...
160
click to vote
TACAS
2010
Springer
15 years 12 months ago
2010
Springer
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...
176
click to vote
ESA
1998
Springer
15 years 11 months ago
1998
Springer
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent ...
182
click to vote
PPSN
1998
Springer
15 years 11 months ago
1998
Springer
This paper presents a comparative study of Evolutionary Algorithms (EAs) for Constraint Satisfaction Problems (CSPs). We focus on EAs where fitness is based on penalization of cons...