Sciweavers

365 search results - page 1 / 73
» Solving the Multiplication Constraint in Several Approximati...
Sort
View
AAAI
1998
13 years 6 months ago
Solving Very Large Weakly Coupled Markov Decision Processes
We present a technique for computing approximately optimal solutions to stochastic resource allocation problems modeled as Markov decision processes (MDPs). We exploit two key pro...
Nicolas Meuleau, Milos Hauskrecht, Kee-Eung Kim, L...
CP
2005
Springer
13 years 10 months ago
Using Constraint Programming for Solving Distance CSP with Uncertainty
Many problems in chemistry, robotics or molecular biology can be expressed as a Distance CSP4 . In this paper, we propose a specific methodology for tackling uncertainties in this...
Carlos Grandón, Bertrand Neveu
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
13 years 10 months ago
Computing the multiplicity structure in solving polynomial systems
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
Barry H. Dayton, Zhonggang Zeng
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 5 months ago
Approximating the Gaussian Multiple Description Rate Region Under Symmetric Distortion Constraints
We consider multiple description (MD) coding for the Gaussian source with K descriptions under the symmetric meansquared error (MSE) distortion constraints, and provide an approxim...
Chao Tian, Soheil Mohajer, Suhas N. Diggavi