798 search results - page 30 / 160 » Using Genetic Algorithms for Solving Hard Problems in GIS |
ICCAD
1997
IEEE
14 years 21 days ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
DATE
2004
IEEE
14 years 7 days ago
2004
IEEE
The growing use of digital signal processors (DSPs) in embedded systems necessitates the use of optimizing compilers supporting special hardware features. Due to the irregular arc...
PRICAI
1998
Springer
14 years 21 days ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
GECCO
2006
Springer
14 years 4 days ago
2006
Springer
In this paper, we propose a simple genetic algorithm for finding the optimal conformation of a protein using the three-dimensional square HP model. A backtracking procedure is use...
RECOMB
2005
Springer
14 years 8 months ago
2005
Springer
Abstract. The objective function of the genome rearrangement problems allows the integration of other genome-level problems so that they may be solved simultaneously. Three example...