1040 search results - page 167 / 208 » Rounding algorithms for covering problems |
106
click to vote
CODES
1999
IEEE
15 years 7 months ago
1999
IEEE
In this paper, we propose a fast and simple heuristic for the cosynthesis problem targeting the system-on-chip (SOC) design. The proposed algorithm covers from implementation sele...
153
click to vote
JSAT
2010
14 years 10 months ago
2010
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...
136
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
This paper focuses on the study of the behavior of a genetic algorithm based classifier system, the Adapted Pittsburgh Classifier System (A.P.C.S), on maze type environments con...
154
Voted
IACR
2011
14 years 3 months ago
2011
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
139
click to vote
ACIIDS
2009
IEEE
15 years 1 months ago
2009
IEEE
In this study, we strive to combine the advantages of fuzzy theory, genetic algorithms (GA), H tracking control schemes, smooth control and adaptive laws to design an adaptive fuzz...