Results 11  20
of
2,661
Abstract conflict driven learning
 In POPL
, 2013
"... Modern satisfiability solvers implement an algorithm, called Conflict Driven Clause Learning, which combines search for a model with analysis of conflicts. We show that this algorithm can be generalised to solve the latticetheoretic problem of determining if an additive transformer on a Boolean l ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
Modern satisfiability solvers implement an algorithm, called Conflict Driven Clause Learning, which combines search for a model with analysis of conflicts. We show that this algorithm can be generalised to solve the latticetheoretic problem of determining if an additive transformer on a Boolean
Stochastic backpropagation and approximate inference in deep generative models
, 2014
"... We marry ideas from deep neural networks and approximate Bayesian inference to derive a generalised class of deep, directed generative models, endowed with a new algorithm for scalable inference and learning. Our algorithm introduces a recognition model to represent an approximate posterior distri ..."
Abstract

Cited by 25 (3 self)
 Add to MetaCart
We marry ideas from deep neural networks and approximate Bayesian inference to derive a generalised class of deep, directed generative models, endowed with a new algorithm for scalable inference and learning. Our algorithm introduces a recognition model to represent an approximate posterior
Regulation of a Monopoly Generating
, 2007
"... We consider a monopoly that generates externalities. These depend on either the volume of services provided, or the number of clients, or both. We study the socially optimal prices and propose a regulatory mechanism to decentralize the optimum allocation. The mechanism, which is an generalised vers ..."
Abstract
 Add to MetaCart
We consider a monopoly that generates externalities. These depend on either the volume of services provided, or the number of clients, or both. We study the socially optimal prices and propose a regulatory mechanism to decentralize the optimum allocation. The mechanism, which is an generalised
An Extension Of Zeilberger's Fast Algorithm To General Holonomic Functions
 DISCRETE MATH
, 2000
"... We extend Zeilberger's fast algorithm for definite hypergeometric summation to nonhypergeometric holonomic sequences. The algorithm generalizes to differential and qcases as well. Its theoretical justification is based on a description by linear operators and on the theory of holonomy. ..."
Abstract

Cited by 93 (5 self)
 Add to MetaCart
We extend Zeilberger's fast algorithm for definite hypergeometric summation to nonhypergeometric holonomic sequences. The algorithm generalizes to differential and qcases as well. Its theoretical justification is based on a description by linear operators and on the theory of holonomy.
A Generalised Approach to Supervisor Synthesis
"... We present a generalisation of the supervisory control problem proposed by Ramadge and Wonham. The objective of that problem is to synthesise a controller which constrains a system’s behaviour according to a given specification, ensuring controllability and coaccessibility. By introducing a new re ..."
Abstract
 Add to MetaCart
the computational complexity of any generalisation. As an example we solve the synthesis problem under consideration of fairness constraints. 1
Generalised analysis of a QoSaware routing algorithm
 in IEEE GLOBECOM'98
, 1998
"... Abslracr Modem communicatians services have strict quality of service (QoS) quiremenis, with separate eonstrsinb on bandwidth, delay and error tolerance. The task of finding a mute through a network satisfying multiple QoS constmiits is intractable, but increasingly important for modern atmmunies ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
atmmuniestions apptications. This paper investigates an appmximate algorithm, which has pously been analysed for the w e of two constraints, and presents a generalisation of this analysis to the m e of an srbihary number of constraints. The bloeliing rate of this algorithm is then empirically compared
Methods to account for spatial autocorrelation in the analysis of species distributional data: a review
 Ecography
, 2007
"... ..."
Stateoftheart of Vehicular Traffic Flow Modelling
 Delft University of Technology, Delft, The
, 2001
"... Nowadays traffic flow and congestion is one of the main societal and economical problems related to transportation in industrialised countries. In this respect, managing traffic in congested networks requires a clear understanding of traffic flow operations. That is, insights into what causes conge ..."
Abstract

Cited by 87 (1 self)
 Add to MetaCart
. For each of the categories, issues like modelling accuracy, applicability, generalisability, and model calibration and validation, are discussed.
On Maximisation of the Likelihood for the Generalised Gamma Distribution
"... We explore computational aspects of likelihood maximisation for the generalised gamma distribution. We improve on earlier work by being the first to formulate the iterative approach to solution of the likelihood score equations in such a way that the individual equations involved are uniquely solva ..."
Abstract
 Add to MetaCart
We explore computational aspects of likelihood maximisation for the generalised gamma distribution. We improve on earlier work by being the first to formulate the iterative approach to solution of the likelihood score equations in such a way that the individual equations involved are uniquely
ON PRODUCTS OF LONG CYCLES: SHORT CYCLE DEPENDENCE AND SEPARATION PROBABILITIES
"... ABSTRACT. We present various results on multiplying cycles in the symmetric group. One result is a generalisation of the following theorem of Boccara (1980): the number of ways of writing an odd permutation in the symmetric group on n symbols as a product of an ncycle and an (n − 1)cycle is indep ..."
Abstract
 Add to MetaCart
ABSTRACT. We present various results on multiplying cycles in the symmetric group. One result is a generalisation of the following theorem of Boccara (1980): the number of ways of writing an odd permutation in the symmetric group on n symbols as a product of an ncycle and an (n − 1)cycle
Results 11  20
of
2,661