Sciweavers

65 search results - page 12 / 13
» The Monty Python method for generating random variables
Sort
View
AAAI
1996
15 years 2 months ago
Lazy Arc Consistency
Arc consistency filtering is widely used in the framework of binary constraint satisfaction problems: with a low complexity, inconsistency may be detected,and domains are filtered...
Thomas Schiex, Jean-Charles Régin, Christin...
IMCSIT
2010
14 years 11 months ago
Efficient Portfolio Optimization with Conditional Value at Risk
The portfolio optimization problem is modeled as a mean-risk bicriteria optimization problem where the expected return is maximized and some (scalar) risk measure is minimized. In ...
Wlodzimierz Ogryczak, Tomasz Sliwinski
CP
2007
Springer
15 years 5 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
UAI
2008
15 years 2 months ago
Efficient Inference in Persistent Dynamic Bayesian Networks
Numerous temporal inference tasks such as fault monitoring and anomaly detection exhibit a persistence property: for example, if something breaks, it stays broken until an interve...
Tomás Singliar, Denver Dash
ICASSP
2011
IEEE
14 years 5 months ago
Joint source-channel rate control for pixel-domain distributed video coding
We study the scenario of pixel-domain distributed video coding for noisy transmission environments and propose a method to allocate the available rate between source coding and ch...
Hu Chen, Eckehard G. Steinbach, Chang Wen Chen