Sciweavers

3250 search results - page 411 / 650
» An Algorithm to Solve a Linear Program
Sort
View
EOR
2007
88views more  EOR 2007»
15 years 6 months ago
The stochastic location model with risk pooling
In this paper, we present a stochastic version of the Location Model with Risk Pooling (LMRP) that optimizes location, inventory, and allocation decisions under random parameters ...
Lawrence V. Snyder, Mark S. Daskin, Chung-Piaw Teo
CSL
2009
Springer
16 years 1 months ago
On the Parameterised Intractability of Monadic Second-Order Logic
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
Stephan Kreutzer
ICPR
2000
IEEE
15 years 10 months ago
MRF Solutions for Probabilistic Optical Flow Formulations
In this paper we propose an efficient, non-iterative method for estimating optical flow. We develop a probabilistic framework that is appropriate for describing the inherent uncer...
Sébastien Roy, Venu Govindu
IJNSEC
2010
143views more  IJNSEC 2010»
15 years 1 months ago
Nonce Generation For The Digital Signature Standard
Digital Signature Algorithm (DSA) is an underlying algorithm to form a signature in the Digital Signature Standard (DSS). DSA uses a new random number (or nonce) each time a signa...
Rajendra S. Katti, Rajesh G. Kavasseri
GECCO
2011
Springer
232views Optimization» more  GECCO 2011»
14 years 10 months ago
Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis
When the epistasis of the fitness function is bounded by a constant, we show that the expected fitness of an offspring of the (1+1)-EA can be efficiently computed for any point...
Andrew M. Sutton, Darrell Whitley, Adele E. Howe