5316 search results - page 129 / 1064 » Which Search Problems Are Random |
116
click to vote
DAM
2008
15 years 3 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
149
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
In this paper, a new scheme to address the face recognition problem is proposed. Different from traditional face recognition approaches which represent each facial image by a sing...
117
click to vote
IEAAIE
2005
Springer
15 years 9 months ago
2005
Springer
When using a constructive search algorithm, solutions to scheduling problems such as the job shop and open shop scheduling problems are typically represented as permutations of the...
139
Voted
AIR
2004
15 years 3 months ago
2004
The vehicle routing problems with time windows are challenging delivery problems in which instances involving 100 customers or more can be difficult to solve. There were many inter...
139
click to vote
ECAI
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...