1095 search results - page 32 / 219 » Preprocessing of Intractable Problems |
TEC
2002
13 years 7 months ago
2002
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
GECCO
2003
Springer
14 years 28 days ago
2003
Springer
Abstract. As a preprocessing for genetic algorithms, static reordering helps genetic algorithms effectively create and preserve high-quality schemata, and consequently improves th...
CAIP
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. We suggest a novel approach to the Color Constancy Problem for multispectral imagery. Our approach is based on a dichromatic illumination model and lters out all spectral...
TWC
2008
13 years 7 months ago
2008
A box-constrained integer least squares problem (BILS) arises from several wireless communications applications. Solving a BILS problem usually has two stages: reduction (or prepro...
FUN
2007
Springer
13 years 11 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...