Sciweavers

1434 search results - page 180 / 287
» Stochastic computation
Sort
View
DISOPT
2007
109views more  DISOPT 2007»
15 years 4 months ago
Sequential pairing of mixed integer inequalities
We present a scheme for generating new valid inequalities for mixed integer programs by taking pairwise combinations of existing valid inequalities. Our scheme is related to mixed...
Yongpei Guan, Shabbir Ahmed, George L. Nemhauser
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 11 months ago
Fast and Faster: A Comparison of Two Streamed Matrix Decomposition Algorithms
With the explosion of the size of digital dataset, the limiting factor for decomposition algorithms is the number of passes over the input, as the input is often stored out-of-cor...
Radim Rehurek
ICALP
2000
Springer
15 years 7 months ago
Amalgamation of Transition Sequences in the PEPA Formalism
This report presents a formal approach to reducing sequences in PEPA components. Performing the described amalgamation procedure we may remove, from the underlying Markov chain, t...
Jane Hillston, J. Tomasik
COR
2006
112views more  COR 2006»
15 years 4 months ago
A continuous approach to considering uncertainty in facility design
This paper presents a formulation of the facilities block layout problem which explicitly considers uncertainty in material handling costs on a continuous scale by use of expected...
Bryan A. Norman, Alice E. Smith
AI
2003
Springer
15 years 9 months ago
Iterated Robust Tabu Search for MAX-SAT
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in ...
Kevin Smyth, Holger H. Hoos, Thomas Stützle