1095 search results - page 32 / 219 » Preprocessing of Intractable Problems |
136
Voted
TEC
2002
15 years 8 days 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...
53
Voted
GECCO
2003
Springer
15 years 5 months 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...
129
click to vote
CAIP
1995
Springer
15 years 4 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...
104
click to vote
TWC
2008
15 years 16 days 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...
112
Voted
FUN
2007
Springer
15 years 4 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 ...