Sciweavers

16504 search results - page 116 / 3301
» New Problems, New Solutions
Sort
View
CVPR
2005
IEEE
16 years 8 months ago
Shape from Shading: A Well-Posed Problem?
Shape From Shading is known to be an ill-posed problem. We show in this paper that if we model the problem in a different way than it is usually done, more precisely by taking int...
Emmanuel Prados, Olivier D. Faugeras
CORR
2004
Springer
113views Education» more  CORR 2004»
15 years 6 months ago
A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
Sándor P. Fekete, Jörg Schepers
IPPS
2007
IEEE
16 years 20 days ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
BMCBI
2010
95views more  BMCBI 2010»
15 years 6 months ago
Heuristics for the inversion median problem
Background: The study of genome rearrangements has become a mainstay of phylogenetics and comparative genomics. Fundamental in such a study is the median problem: given three geno...
Vaibhav Rajan, Andrew Wei Xu, Yu Lin, Krister M. S...
HEURISTICS
2010
15 years 3 months ago
An adaptive memory algorithm for the split delivery vehicle routing problem
Abstract The split delivery vehicle routing problem (SDVRP) relaxes routing restrictions forcing unique deliveries to customers and allows multiple vehicles to satisfy customer dem...
Rafael E. Aleman, Xinhui Zhang, Raymond R. Hill