Sciweavers

607 search results - page 32 / 122
» Unifying Exact Completions
Sort
View
130
Voted
IPCO
1998
152views Optimization» more  IPCO 1998»
15 years 2 months ago
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
Alix Munier, Maurice Queyranne, Andreas S. Schulz
96
Voted
LICS
2007
IEEE
15 years 7 months ago
Symmetric Datalog and Constraint Satisfaction Problems in Logspace
We introduce symmetric Datalog, a syntactic restriction of linear Datalog and show that its expressive power is exactly that of restricted symmetric monotone Krom SNP. The deep re...
László Egri, Benoit Larose, Pascal T...
87
Voted
CSL
2007
Springer
15 years 6 months ago
Continuous Previsions
We define strong monads of continuous (lower, upper) previsions, and of forks, modeling both probabilistic and non-deterministic choice. This is an elegant alternative to recent p...
Jean Goubault-Larrecq
84
Voted
BILDMED
2007
15 years 2 months ago
Semi-automatic Segmentation of the Patellar Cartilage in MRI
A software system for semi-automatic segmentation of the patellar cartilage is introduced. Providing tools for sub-pixel accurate edge tracing, automatic contour completion, and ad...
Lorenz König, Martin Groher, Andreas Keil, Ch...
EOR
2008
82views more  EOR 2008»
15 years 21 days ago
Solving the pallet loading problem
This paper presents new bounds, heuristics, and an exact algorithm for the Pallet Loading Problem (PLP). PLP maximizes the number of boxes placed on a rectangular pallet. All boxe...
Gustavo H. A. Martins, Robert F. Dell