Sciweavers

3318 search results - page 221 / 664
» The Weak Instance Model
Sort
View
AAAI
2004
15 years 7 months ago
Low-Knowledge Algorithm Control
This paper addresses the question of allocating computational resources among a set of algorithms in order to achieve the best performance on a scheduling problem instance. Our pr...
Tom Carchrae, J. Christopher Beck
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 6 months ago
Bayesian Optimisation Algorithm for Nurse Scheduling
: Our research has shown that schedules can be built mimicking a human scheduler by using a set of rules that involve domain knowledge. This chapter presents a Bayesian Optimizatio...
Jingpeng Li, Uwe Aickelin
CPC
2006
116views more  CPC 2006»
15 years 6 months ago
Finding Large Independent Sets in Polynomial Expected Time
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
Amin Coja-Oghlan
EOR
2006
134views more  EOR 2006»
15 years 6 months ago
A smoothing heuristic for a bilevel pricing problem
In this paper, we provide a heuristic procedure, that performs well from a global optimality point of view, for an important and difficult class of bilevel programs. The algorithm...
Jean-Pierre Dussault, Patrice Marcotte, Séb...
FGCS
2007
108views more  FGCS 2007»
15 years 5 months ago
From bioinformatic web portals to semantically integrated Data Grid networks
We propose a semi-automated method for redeploying bioinformatic databases indexed in a Web portal as a decentralized, semantically integrated and service-oriented Data Grid. We g...
Adriana Budura, Philippe Cudré-Mauroux, Kar...