Sciweavers

1547 search results - page 256 / 310
» Randomized Variable Elimination
Sort
View
COLT
1992
Springer
14 years 2 months ago
Learning Switching Concepts
We consider learning in situations where the function used to classify examples may switch back and forth between a small number of different concepts during the course of learnin...
Avrim Blum, Prasad Chalasani
SMA
1993
ACM
107views Solid Modeling» more  SMA 1993»
14 years 2 months ago
Relaxed parametric design with probabilistic constraints
: Parametric design is an important modeling paradigm in computer aided design. Relationships (constraints) between the degrees of freedom (DOFs) of the model, instead of the DOFs ...
Yacov Hel-Or, Ari Rappoport, Michael Werman
AUSAI
2007
Springer
14 years 1 months ago
Branching Rules for Satisfiability Analysed with Factor Analysis
Factor analysis is a statistical technique for reducing the number of factors responsible for a matrix of correlations to a smaller number of factors that may reflect underlying va...
Richard J. Wallace, Stuart Bain
CISSE
2007
Springer
14 years 1 months ago
Issues in Simulation for Valuing Long-Term Forwards
Abstract- This paper explores valuing long-term equity forwardcontracts or futures where both the underlying volatility and the interest rates are modeled as stochastic random vari...
Phillip G. Bradford, Alina Olteanu
CP
2007
Springer
14 years 1 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