457 search results - page 60 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
ISPD
1998
ACM
13 years 11 months ago
1998
ACM
In this paper, we formulate a new class of optimization problem, named the general CH-posynomial program, and reveal the general dominance property. We propose an efcient algorith...
ECSQARU
1995
Springer
13 years 11 months ago
1995
Springer
The paper presents a method for uncertainty propagation in Bayesian networks in symbolic, as opposed to numeric, form. The algebraic structure of probabilities is characterized. Th...
AAAI
1996
13 years 8 months ago
1996
The paper presents an efficient goal oriented algorithm for symbolic propagation in Bayesian networks. The proposed algorithm performs symbolic propagation using numerical methods...
MANSCI
2006
13 years 7 months ago
2006
We present a new approach to pricing American-style derivatives that is applicable to any Markovian setting (i.e., not limited to geometric Brownian motion) for which European cal...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...