Sciweavers

1971 search results - page 30 / 395
» Tabu search - Uncharted domains
Sort
View
EURODAC
1994
IEEE
140views VHDL» more  EURODAC 1994»
15 years 1 months ago
GSA: scheduling and allocation using genetic algorithm
This paper describes a unique approach to scheduling and allocation problem in high-level synthesis using genetic algorithm (GA). This approach is dierent from a previous attempt ...
Ali Shahid, Muhammad S. T. Benten, Sadiq M. Sait
EVOW
2006
Springer
15 years 1 months ago
A Memetic Algorithm with Bucket Elimination for the Still Life Problem
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...
José E. Gallardo, Carlos Cotta, Antonio J. ...
EOR
2006
70views more  EOR 2006»
14 years 9 months ago
Heuristics for matrix bandwidth reduction
In this work, we provide two heuristic algorithms for the matrix bandwidth reduction problem. The first is a genetic algorithm and the second uses node label adjustments. Experime...
Andrew Lim, Brian Rodrigues, Fei Xiao
TIT
1998
79views more  TIT 1998»
14 years 9 months ago
Greedy and Heuristic Algorithms for Codes and Colorings
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
Tuvi Etzion, Patric R. J. Östergård
SAC
2012
ACM
13 years 5 months ago
Decrypting classical cipher text using Markov chain Monte Carlo
In this paper, we present the use of Markov Chain Monte Carlo (MCMC) methods to attack the classical ciphers. We use frequency analysis as our basic tool. First we investigate the...
Jian Chen, Jeffrey S. Rosenthal