1964 search results - page 79 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
CEC
2009
IEEE
14 years 16 days ago
2009
IEEE
— Many real-world dynamic optimisation problems have constraints, and in certain cases not only the objective function changes over time, but the constraints also change as well....
CEEMAS
2005
Springer
14 years 1 months ago
2005
Springer
A honeybee colony has to choose among several nectar sources in the environment, each fluctuating in quality over time. Successful forager bees return to the hive and perform dance...
DAGSTUHL
2007
13 years 9 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
ISPASS
2009
IEEE
2009
IEEE
Machine learning based online performance prediction for runtime parallelization and task scheduling
14 years 2 months ago
—With the emerging many-core paradigm, parallel programming must extend beyond its traditional realm of scientific applications. Converting existing sequential applications as w...
CIVR
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents a new approach for video clip retrieval based on Earth Mover’s Distance (EMD). Instead of imposing one-to-one matching constraint as in [11, 14], our approach...