Sciweavers

798 search results - page 9 / 160
» Using Genetic Algorithms for Solving Hard Problems in GIS
Sort
View
ADMA
2005
Springer
189views Data Mining» more  ADMA 2005»
14 years 2 months ago
Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem
In this paper, we design genetic algorithm and simulated annealing algorithm and their parallel versions to solve the Closest String problem. Our implementation and experiments sho...
Xuan Liu, Hongmei He, Ondrej Sýkora
CEC
2007
IEEE
14 years 13 days ago
Solving, rating and generating Sudoku puzzles with GA
This paper studies the problems involved in solving, rating and generating Sudoku puzzles with genetic algorithms (GA). Sudoku is a number puzzle that has recently become a worldwi...
Timo Mantere, Janne Koljonen
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
14 years 3 days ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin
EUROCRYPT
2003
Springer
14 years 1 months ago
CAPTCHA: Using Hard AI Problems for Security
We introduce captcha, an automated test that humans can pass, but current computer programs can’t pass: any program that has high success over a captcha can be used to solve an u...
Luis von Ahn, Manuel Blum, Nicholas J. Hopper, Joh...
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
13 years 8 months ago
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...