492 search results - page 6 / 99 » Simplifying Probabilistic Programs Using Computer Algebra |
ICCS
2007
Springer
15 years 2 months ago
2007
Springer
Abstract. SymGrid-Par is a new framework for executing large computer algebra problems on computational Grids. We present the design of SymGrid-Par, which supports multiple compute...
KCAP
2003
ACM
15 years 3 months ago
2003
ACM
While existing learning techniques can be viewed as inducing programs from examples, most research has focused on rather narrow classes of programs, e.g., decision trees or logic ...
CN
2008
14 years 10 months ago
2008
Capacity is an important property for QoS support in Mobile Ad Hoc Networks (MANETs) and has been extensively studied. However, most approaches rely on simplified models (e.g., pr...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
AAECC
2008
Springer
14 years 10 months ago
2008
Springer
In a previous article [14], we proved the existence of resolvent representations for regular differential ideals. The present paper provides practical algorithms for computing suc...