Sciweavers

3874 search results - page 547 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
JSSPP
2005
Springer
15 years 10 months ago
Scheduling Moldable BSP Tasks
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use...
Pierre-François Dutot, Marco Aurélio...
ECCV
2010
Springer
15 years 10 months ago
Optimizing Complex Loss Functions in Structured Prediction
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...
HM
2009
Springer
145views Optimization» more  HM 2009»
15 years 9 months ago
A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal + +
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
Raffaele Cipriano, Luca Di Gaspero, Agostino Dovie...
ECCV
2010
Springer
15 years 8 months ago
Geometry Construction from Caustic Images
In this work we investigate an inverse geometry problem. Given a light source, a diffuse plane and a caustic image, how must a geometric object look like (transmissive or reflect...
ECML
2007
Springer
15 years 8 months ago
Efficient Continuous-Time Reinforcement Learning with Adaptive State Graphs
Abstract. We present a new reinforcement learning approach for deterministic continuous control problems in environments with unknown, arbitrary reward functions. The difficulty of...
Gerhard Neumann, Michael Pfeiffer, Wolfgang Maass