84 search results - page 13 / 17 » Solving the Course Timetabling Problem with a Hybrid Heurist... |
EVOW
2004
Springer
14 years 27 days ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
ANOR
2011
13 years 2 months ago
2011
A vital task facing government agencies and commercial organizations that report data is to represent the data in a meaningful way and simultaneously to protect the confidentialit...
HYBRID
2010
Springer
14 years 2 months ago
2010
Springer
Mixture-of-Experts (MoE) systems solve intricate problems by combining results generated independently by multiple computational models (the “experts”). Given an instance of a...
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...