Sciweavers

1274 search results - page 43 / 255
» N-fold integer programming
Sort
View
AAAI
1998
13 years 11 months ago
An Integer Local Search Method with Application to Capacitated Production Planning
Production planning is an important task in manufacturing systems. We consider a real-world capacitated lot-sizing problem (CLSP) from the process industry. Because the problem re...
Joachim P. Walser, Ramesh Iyer, Narayan Venkatasub...
CORR
2010
Springer
208views Education» more  CORR 2010»
13 years 10 months ago
MapReduce for Integer Factorization
Abstract. Integer factorization is a very hard computational problem. Currently no ecient algorithm for integer factorization is publicly known. However, this is an important probl...
Javier Tordable
NDSS
2007
IEEE
14 years 4 months ago
RICH: Automatically Protecting Against Integer-Based Vulnerabilities
We present the design and implementation of RICH (Run-time Integer CHecking), a tool for efficiently detecting integer-based attacks against C programs at run time. C integer bug...
David Brumley, Dawn Xiaodong Song, Tzi-cker Chiueh...
ICALP
1992
Springer
14 years 2 months ago
Fast Integer Merging on the EREW PRAM
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
Torben Hagerup
IPCO
2007
126views Optimization» more  IPCO 2007»
13 years 11 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...