361 search results - page 23 / 73 » Approximate counting by dynamic programming |
SPIN
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. In this article, we address the problem of statically determining an approximation of the communication topology of concurrent programs. These programs may contain dynami...
ICLP
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. There is currently a large interest in probabilistic logical models. A popular algorithm for approximate probabilistic inference with such models is Gibbs sampling. From ...
CPHYSICS
2006
13 years 7 months ago
2006
The WATERWAVES program suite performs complex scattering calculations by propagating a wave packet in a complex, full-dimensional potential for non-rotating (J = 0) but vibrating ...
JCO
2006
13 years 7 months ago
2006
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
EPS
1997
Springer
13 years 11 months ago
1997
Springer
Typical applications of evolutionary optimization involve the off-line approximation of extrema of static multi-modal functions. Methods which use a variety of techniques to self-...