492 search results - page 29 / 99 » Simplifying Probabilistic Programs Using Computer Algebra |
102
Voted
SLP
1994
15 years 4 days ago
1994
Most of the research, to date, on optimizing program transformations for declarative languages has focused on sequential execution strategies. In this paper, we consider a class o...
FCCM
2000
IEEE
15 years 3 months ago
2000
IEEE
Simplifying the programming models is paramount to the success of reconfigurable computing. We apply the principles of object-oriented programming to the design of stream archite...
TLCA
2009
Springer
15 years 5 months ago
2009
Springer
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanis...
SIAMSC
2010
14 years 9 months ago
2010
A recursive acceleration method is proposed for multiplicative multilevel aggregation algorithms that calculate the stationary probability vector of large, sparse, and irreducible ...
ESOP
2005
Springer
15 years 4 months ago
2005
Springer
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...