Sciweavers

1101 search results - page 62 / 221
» Comparing Computer Models Solving Number Series Problems
Sort
View
FSTTCS
1995
Springer
15 years 1 months ago
Branch and Bound on the Network Model
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
Sanjay Jain
CINQ
2004
Springer
131views Database» more  CINQ 2004»
15 years 3 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
EOR
2007
101views more  EOR 2007»
14 years 9 months ago
Using aggregation to optimize long-term production planning at an underground mine
Motivated by an underground mining operation at Kiruna, Sweden, we formulate a mixed integer program to schedule iron ore production over multiple time periods. Our optimization m...
Alexandra M. Newman, Mark Kuchta
HEURISTICS
2008
124views more  HEURISTICS 2008»
14 years 9 months ago
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
Michael Polacek, Karl F. Doerner, Richard F. Hartl...
ICIP
1995
IEEE
15 years 1 months ago
A harmonic retrieval framework for discontinuous motion estimation
Abstract— Motion discontinuities arise when there are occlusions or multiple moving objects in the scene that is imaged. Conventional regularization techniques use smoothness con...
Wei-Ge Chen, Georgios B. Giannakis, N. Nandhakumar