17366 search results - page 64 / 3474 » New Revision Algorithms |
AUSAI
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
DATE
2010
IEEE
15 years 2 months ago
2010
IEEE
Modern FPGAs have been designed with advanced integrated circuit techniques that allow high speed and low power performance, joined to reconfiguration capabilities. This makes new...
NETWORKS
2008
14 years 9 months ago
2008
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper, we introduce a new algorithm for corner detection. Instead of calculating the gradients along x and y-axes, which is the common step of many existed algorithms, we ...
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
—The first hitting time (FHT) plays an important role in convergence evaluation for evolutionary algorithms. However, the current criteria of the FHT are mostly under a hypothesi...