Sciweavers

389 search results - page 50 / 78
» Computational Alternatives to Random Number Generators
Sort
View
MP
2006
87views more  MP 2006»
13 years 7 months ago
Convexity and decomposition of mean-risk stochastic programs
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...
Shabbir Ahmed
INFOCOM
2003
IEEE
14 years 28 days ago
Robust Location Detection in Emergency Sensor Networks
— We propose a new framework for providing robust location detection in emergency response systems, based on the theory of identifying codes. The key idea of this approach is to ...
Saikat Ray, Rachanee Ungrangsi, Francesco De Pelle...
CCE
2008
13 years 7 months ago
Global optimization of multiscenario mixed integer nonlinear programming models arising in the synthesis of integrated water net
The problem of optimal synthesis of an integrated water system is addressed in this work, where water using processes and water treatment operations are combined into a single net...
Ramkumar Karuppiah, Ignacio E. Grossmann
RSA
2010
107views more  RSA 2010»
13 years 6 months ago
Continuum limits for classical sequential growth models
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
Graham Brightwell, Nicholas Georgiou
DCC
2003
IEEE
14 years 7 months ago
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...
Phong Q. Nguyen, Igor Shparlinski