Sciweavers

16404 search results - page 894 / 3281
» A set coverage problem
Sort
View
MSOM
2008
103views more  MSOM 2008»
15 years 7 months ago
Facility Location with Stochastic Demand and Constraints on Waiting Time
We analyze the problem of optimal location of a set of facilities in the presence of stochastic demand and congestion. Customers travel to the closest facility to obtain service; ...
Opher Baron, Oded Berman, Dmitry Krass
ATMOS
2010
150views Optimization» more  ATMOS 2010»
15 years 6 months ago
Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling
The aim of the train timetabling problem is to find a conflict free timetable for a set of passenger and freight trains along their routes in an infrastructure network. Several ...
Frank Fischer, Christoph Helmberg
IEEEHPCS
2010
15 years 6 months ago
3-SAT on CUDA: Towards a massively parallel SAT solver
This work presents the design and implementation of a massively parallel 3-SAT solver, specifically targeting random problem instances. Our approach is deterministic and features ...
Quirin Meyer, Fabian Schonfeld, Marc Stamminger, R...
MICCAI
2010
Springer
15 years 6 months ago
Simultaneous Geometric - Iconic Registration
In this paper, we introduce a novel approach to bridge the gap between the landmark-based and the iconic-based voxel-wise registration methods. The registration problem is formulat...
Aristeidis Sotiras, Yangming Ou, Ben Glocker, Chri...
MICS
2010
77views more  MICS 2010»
15 years 6 months ago
Preemptive Scheduling of Equal-Length Jobs in Polynomial Time
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...
George B. Mertzios, Walter Unger