Sciweavers

1776 search results - page 228 / 356
» Uncertain Linear Constraints
Sort
View
CP
2005
Springer
15 years 12 months ago
Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker
IJCV
2006
159views more  IJCV 2006»
15 years 6 months ago
Wide Baseline Matching between Unsynchronized Video Sequences
3D reconstruction of a dynamic scene from features in two cameras usually requires synchronization and correspondences between the cameras. These may be hard to achieve due to occl...
Lior Wolf, Assaf Zomet
IOR
2007
106views more  IOR 2007»
15 years 6 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
OSN
2007
185views more  OSN 2007»
15 years 5 months ago
Comparison of ILP formulations for the RWA problem
— We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networ...
Brigitte Jaumard, Christophe Meyer, B. Thiongane
JBCB
2010
123views more  JBCB 2010»
15 years 4 months ago
Characterizing the Space of interatomic Distance Distribution Functions Consistent with Solution Scattering Data
: Scattering of neutrons and x-rays from molecules in solution offers alternative approaches to the studying of a wide range of macromolecular structures in their solution state w...
Paritosh A. Kavathekar, Bruce A. Craig, Alan M. Fr...