Sciweavers

4377 search results - page 282 / 876
» Mass problems and randomness
Sort
View
EUSFLAT
2009
175views Fuzzy Logic» more  EUSFLAT 2009»
15 years 4 months ago
The Minimization of the Risk of Falling in Portfolios under Uncertainty
Abstract-- A portfolio model to minimize the risk of falling under uncertainty is discussed. The risk of falling is represented by the value-at-risk of rate of return. Introducing ...
Yuji Yoshida
JCS
2011
156views more  JCS 2011»
15 years 1 months ago
Securing low-cost RFID systems: An unconditionally secure approach
We explore a new direction towards solving the identity authentication problem in RFID systems. We break the RFID authentication process into two main problems: message authenticat...
Basel Alomair, Loukas Lazos, Radha Poovendran
JCST
2010
189views more  JCST 2010»
15 years 1 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
EC
2008
120views ECommerce» more  EC 2008»
15 years 6 months ago
Genetic Algorithms with Memory- and Elitism-Based Immigrants in Dynamic Environments
In recent years the genetic algorithm community has shown a growing interest in studying dynamic optimization problems. Several approaches have been devised. The random immigrants...
Shengxiang Yang
ECCC
2010
122views more  ECCC 2010»
15 years 5 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah