Sciweavers

105 search results - page 5 / 21
» Optimal importance sampling for the approximation of integra...
Sort
View
AUSAI
2004
Springer
15 years 2 months ago
An ACO Algorithm for the Most Probable Explanation Problem
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
Haipeng Guo, Prashanth R. Boddhireddy, William H. ...
84
Voted
HYBRID
2009
Springer
15 years 4 months ago
Computation of Discrete Abstractions of Arbitrary Memory Span for Nonlinear Sampled Systems
ion of discrete abstractions of arbitrary memory span for nonlinear sampled systems Gunther Reißig⋆ Technische Universit¨at Berlin, Fakult¨at Elektrotechnik und Informatik, He...
Gunther Reißig
116
Voted
WSC
2008
14 years 12 months ago
Optimizing portfolio tail measures: Asymptotics and efficient simulation optimization
We consider a portfolio allocation problem where the objective function is a tail event such as probability of large portfolio losses. The dependence between assets is captured th...
Sandeep Juneja
102
Voted
PODS
2004
ACM
207views Database» more  PODS 2004»
15 years 9 months ago
Adaptive Sampling for Geometric Problems over Data Streams
Geometric coordinates are an integral part of many data streams. Examples include sensor locations in environmental monitoring, vehicle locations in traffic monitoring or battlefi...
John Hershberger, Subhash Suri
ICCAD
2001
IEEE
107views Hardware» more  ICCAD 2001»
15 years 6 months ago
A Convex Programming Approach to Positive Real Rational Approximation
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. Certain devic...
Carlos P. Coelho, Joel R. Phillips, Luis Miguel Si...