Sciweavers

388 search results - page 61 / 78
» A Mixed Closure-CSP Method to Solve Scheduling Problems
Sort
View
ICS
2007
Tsinghua U.
15 years 7 months ago
GridRod: a dynamic runtime scheduler for grid workflows
Grid Workflows are emerging as practical programming models for solving large e-scientific problems on the Grid. However, it is typically assumed that the workflow components eith...
Shahaan Ayyub, David Abramson
CEC
2007
IEEE
15 years 8 months ago
An investigation of hyper-heuristic search spaces
— Hyper-heuristics or “heuristics that coordinate heuristics” are fastly becoming popular for solving combinatorial optimisation problems. These methods do not search directl...
José Antonio Vázquez Rodrígue...
MLDM
2007
Springer
15 years 7 months ago
PE-PUC: A Graph Based PU-Learning Approach for Text Classification
This paper presents a novel solution for the problem of building text classifier using positive documents (P) and unlabeled documents (U). Here, the unlabeled documents are mixed w...
Shuang Yu, Chunping Li
GECCO
2005
Springer
193views Optimization» more  GECCO 2005»
15 years 7 months ago
On the contribution of gene libraries to artificial immune systems
Gene libraries have been added to Artificial Immune Systems in analogy to biological immune systems, but to date no careful study of their effect has been made. This work investig...
Peter Spellward, Tim Kovacs
CPAIOR
2004
Springer
15 years 7 months ago
Stabilization Issues for Constraint Programming Based Column Generation
Abstract. Constraint programming based column generation is a hybrid optimization framework recently proposed that uses constraint programming (CP) to solve column generation subpr...
Louis-Martin Rousseau