Sciweavers

1984 search results - page 78 / 397
» The colourful feasibility problem
Sort
View
EOR
2006
73views more  EOR 2006»
13 years 10 months ago
Enforcing minimum run length in the cutting stock problem
Deckling, cutting stock or trim loss problems arise when small units are to be fitted into large ones. One aims to reduce stock usage and setups, then favors long runs, surplus ov...
Adolf Diegel, Garth Miller, Edouard Montocchio, Si...
JCST
2008
134views more  JCST 2008»
13 years 10 months ago
Orthogonal Methods Based Ant Colony Search for Solving Continuous Optimization Problems
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional an...
Xiaomin Hu, Jun Zhang, Yun Li
TSMC
1998
92views more  TSMC 1998»
13 years 9 months ago
Solving the orientation-duality problem for a circular feature in motion
Circular features have been commonly used in numerous computer vision application areas for 3-D pose estimation. However, the estimation of such a feature’s pose from 2-D image ...
D. He, Beno Benhabib
TEC
2010
132views more  TEC 2010»
13 years 4 months ago
A Hybrid Evolutionary Approach to the Nurse Rostering Problem
Nurse rostering is a difficult search problem with many constraints. In the literature, a number of approaches have been investigated including penalty function methods to tackle t...
Ruibin Bai, Edmund K. Burke, Graham Kendall, Jingp...
IPPS
2007
IEEE
14 years 4 months ago
Coarse-grain Parallel Execution for 2-dimensional PDE Problems
This paper presents a new approach for the execution of coarse-grain (tiled) parallel SPMD code for applications derived from the explicit discretization of 2-dimensional PDE prob...
Georgios I. Goumas, Nikolaos Drosinos, Vasileios K...