Sciweavers

962 search results - page 56 / 193
» Near-optimal solutions for the generalized max-controlled se...
Sort
View
EOR
2007
158views more  EOR 2007»
14 years 10 months ago
A graph-based hyper-heuristic for educational timetabling problems
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Wit...
Edmund K. Burke, Barry McCollum, Amnon Meisels, Sa...
ECCV
2008
Springer
14 years 11 months ago
Fourier Analysis of the 2D Screened Poisson Equation for Gradient Domain Problems
We analyze the problem of reconstructing a 2D function that approximates a set of desired gradients and a data term. The combined data and gradient terms enable operations like mod...
Pravin Bhat, Brian Curless, Michael F. Cohen, C. L...
GECCO
2007
Springer
187views Optimization» more  GECCO 2007»
15 years 4 months ago
Defining implicit objective functions for design problems
In many design tasks it is difficult to explicitly define an objective function. This paper uses machine learning to derive an objective in a feature space based on selected examp...
Sean Hanna
ICDM
2009
IEEE
149views Data Mining» more  ICDM 2009»
15 years 4 months ago
Accelerated Gradient Method for Multi-task Sparse Learning Problem
—Many real world learning problems can be recast as multi-task learning problems which utilize correlations among different tasks to obtain better generalization performance than...
Xi Chen, Weike Pan, James T. Kwok, Jaime G. Carbon...
MFCS
2004
Springer
15 years 3 months ago
The Bidimensional Theory of Bounded-Genus Graphs
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitr...