1964 search results - page 43 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
JCT
2008
13 years 7 months ago
2008
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
IJHIS
2007
13 years 7 months ago
2007
This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in...
FOCM
2002
13 years 7 months ago
2002
We present an algorithm for computing rigorous solutions to a large class of ordinary differential equations. The main algorithm is based on a partitioning process and the use of i...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— This paper presents a comparison of four bioinspired algorithms (all seen as search engines) with a similar constraint-handling mechanism (Deb’s feasibility rules) to...
EMMCVPR
2009
Springer
14 years 2 months ago
2009
Springer
We describe a scheme for solving Energy Minimization problems, which is based on the A∗ algorithm accomplished with appropriately chosen LP-relaxations as heuristic functions. Th...