Sciweavers

1984 search results - page 37 / 397
» The colourful feasibility problem
Sort
View
ICAISC
2004
Springer
15 years 5 months ago
On Application of Ant Algorithms to Non-bifurcated Multicommodity Flow Problem
Our discussion in this article centers on the application of ant algorithms to the non-bifurcated multicommodity flow problem. We propose a general framework of ant algorithm that...
Krzysztof Walkowiak
EOR
2007
174views more  EOR 2007»
14 years 11 months ago
A Benders approach for the constrained minimum break problem
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
Rasmus V. Rasmussen, Michael A. Trick
ENDM
2010
127views more  ENDM 2010»
14 years 12 months ago
MPQ-trees for orthogonal packing problem
Finding a feasible solution for a bi-dimensional Orthogonal Packing Problem (OPP2) consists in deciding whether a set of rectangular boxes (items) can be packed in a "big&quo...
Cédric Joncour, Arnaud Pêcher, Petru ...
ICCV
2007
IEEE
16 years 1 months ago
Detecting Illumination in Images
In this paper we present a surprisingly simple yet powerful method for detecting illumination--determining which pixels are lit by different lights--in images. Our method is based...
Clément Fredembach, Graham D. Finlayson, Ma...
WSCG
2004
139views more  WSCG 2004»
15 years 1 months ago
Methods for Indexing Stripes in Uncoded Structured Light Scanning Systems
This paper presents robust methods for determining the order of a sequence of stripes captured in an uncoded structured light scanning system, i.e. where all the stripes are proje...
Alan Robinson, Lyuba Alboul, Marcos A. Rodrigues