Sciweavers

10988 search results - page 1969 / 2198
» Algorithmic Folding Complexity
Sort
View
EOR
2002
74views more  EOR 2002»
15 years 3 months ago
Modeling multistage cutting stock problems
In multistage cutting stock problems (CSP) the cutting process is distributed over several successive stages. Every stage except the last one produces intermediate products. The l...
Eugene J. Zak
198
Voted
JODL
2000
175views more  JODL 2000»
15 years 3 months ago
SPIRE: a digital library for scientific information
In this paper we describe the architecture and implementation of a digital library framework for scientific data, particularly imagery, with a focus on support for content-based se...
Lawrence D. Bergman, Vittorio Castelli, Chung-Shen...
ORL
2000
77views more  ORL 2000»
15 years 3 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos
AIEDAM
1998
87views more  AIEDAM 1998»
15 years 3 months ago
Learning to set up numerical optimizations of engineering designs
Gradient-based numerical optimization of complex engineering designs offers the promise of rapidly producing better designs. However, such methods generally assume that the object...
Mark Schwabacher, Thomas Ellman, Haym Hirsh
ASE
1998
81views more  ASE 1998»
15 years 3 months ago
Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
Steven G. Woods, Qiang Yang
« Prev « First page 1969 / 2198 Last » Next »