Sciweavers

1174 search results - page 227 / 235
» Optimizing generics is easy!
Sort
View
SAGA
2009
Springer
14 years 4 months ago
Bounds for Multistage Stochastic Programs Using Supervised Learning Strategies
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
Boris Defourny, Damien Ernst, Louis Wehenkel
IPPS
2008
IEEE
14 years 4 months ago
Software monitoring with bounded overhead
In this paper, we introduce the new technique of HighConfidence Software Monitoring (HCSM), which allows one to perform software monitoring with bounded overhead and concomitantl...
Sean Callanan, David J. Dean, Michael Gorbovitski,...
ICC
2007
IEEE
387views Communications» more  ICC 2007»
14 years 4 months ago
LS Channel Estimation for Mobile OFDM Communications on Time-Varying Frequency-Selective Fading Channels
Abstract— A least-squares (LS) channel estimation (CE) technique for mobile OFDM communications over a rapidly timevarying frequency-selective fading channel is investigated in t...
Jia-Chin Lin
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
14 years 4 months ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}...
Ueli M. Maurer, Stefano Tessaro
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
14 years 3 months ago
MDGA: motif discovery using a genetic algorithm
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive resea...
Dongsheng Che, Yinglei Song, Khaled Rasheed