نتایج جستجو برای: probabilistic logistic time

تعداد نتایج: 2028191  

Journal: :CoRR 2017
Michael Figurnov Artem Sobolev Dmitry P. Vetrov

We present a probabilistic model with discrete latent variables that control the computation time in deep learning models such as ResNets and LSTMs. A prior on the latent variables expresses the preference for faster computation. The amount of computation for an input is determined via amortized maximum a posteriori (MAP) inference. MAP inference is performed using a novel stochastic variationa...

Journal: :Electr. Notes Theor. Comput. Sci. 2005
Alessandra Di Pierro Chris Hankin Herbert Wiklicky

The design of languages supporting network programming is a necessary step towards the formalisation of distributed and mobile computing. The existence of an abstract semantic framework constitutes the basis for a formal analysis of such systems. The KLAIM paradigm [5] provides such a semantic framework by introducing basic concepts and primitives addressing the key aspects of the coordination ...

2016
Yrvann Emzivat Benoît Delahaye Didier Lime Olivier H. Roux

We introduce a new model for the design of concurrent stochastic real-time systems. Probabilistic time Petri nets (PTPN) are an extension of time Petri nets in which the output of tokens is randomised. Such a design allows us to elegantly solve the hard problem of combining probabilities and concurrency. This model further benefits from the concision and expressive power of Petri nets. Furtherm...

2013
Michael Taylor

Suppose A1, . . . , AN are rotation matrices on n-dimensional Euclidean space R, i.e., Aj ∈ SO(n). We want to consider some element of SO(n) that represents an “average” of these elements Aj . There are a number of possible ways to define the notion of an average in this context. One approach has been to write Aj = ej with Zj a real, skew-symmetric n × n matrix (i.e., Zj ∈ skew(n)), and define ...

The purpose of this problem is to choose a set of project activities for crashing, in a way that the expected project time, cost and risk are minimized and the expected quality is maximized. In this problem, each project activity can be performed with a specific executive mode. Each executive mode is characterized with four measures, namely the expected time, cost, quality and risk. In this pap...

Journal: :CoRR 2017
Jiaxin Shi Jianfei Chen Jun Zhu Shengyang Sun Yucen Luo Yihong Gu Yuhao Zhou

In this paper we introduce ZhuSuan, a python probabilistic programming library for Bayesian deep learning, which conjoins the complimentary advantages of Bayesian methods and deep learning. ZhuSuan is built upon Tensorflow. Unlike existing deep learning libraries, which are mainly designed for deterministic neural networks and supervised tasks, ZhuSuan is featured for its deep root into Bayesia...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید