Results 11 - 20
of
37
Probabilistic IntervalValued Computation: Toward a Practical Surrogate for Statistics Inside
- CAD Tools”, IEEE Trans. on CAD of Integrated Circuits and Systems
, 2008
"... Abstract 2nd-order cone program [3]. Connections between time-domain cir-Interval methods offer a general, fine-grain strategy for modeling cuit moments and moments ofprobability distributions enable a sim-correlated range uncertainties in numerical algorithms. We present a ilarly attractive variati ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
variational analysis for linear circuits [4]. new, improved interval algebra that extends the classical affine form Unfortunately, not every variational problem we seek to solve has a to a more rigorous statistical foundation. Range uncertainties now tractable analytical form. What then? Monte Carlo analysis
N.K.: Towards polynomial simplex-like algorithms for market equilibria
, 2013
"... In this paper we consider the problem of computing mar-ket equilibria in the Fisher setting for utility models such as spending constraint and perfect, price-discrimination. These models were inspired from modern e-commerce settings and attempt to bridge the gap between the computationally hard but ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
markets. Such algorithms are desirable due to their conceptual simplicity, ease of implementation and practical-ity. This paper takes a significant step towards this goal by presenting the first Simplex-like algorithms for these mar-kets assuming a positive resolution of an algebraic problem of Cucker
A Study in the Computational Complexity of Temporal Reasoning by
"... Reasoning about temporal and spatial information is a common task in computer science, especially in the field of artificial intelligence. The topic of this thesis is the study of such reasoning from a computational perspective. We study a number of different qualitative point based formalisms for t ..."
Abstract
- Add to MetaCart
for temporal reasoning and provide a complete classification of computational tractability for different time models. We also develop more general methods which can be used for proving tractability and intractability of other relational algebras. Even though most of the thesis pertains to qualitative reasoning
Wavelet representations and Fock space on positive matrices
- J. Funct. Anal
, 2003
"... Abstract. We show that every biorthogonal wavelet determines a representation by operators on Hilbert space satisfying simple identities, which captures the established relationship between orthogonal wavelets and Cuntz-algebra representations in that special case. Each of these representations is s ..."
Abstract
-
Cited by 15 (11 self)
- Add to MetaCart
Abstract. We show that every biorthogonal wavelet determines a representation by operators on Hilbert space satisfying simple identities, which captures the established relationship between orthogonal wavelets and Cuntz-algebra representations in that special case. Each of these representations
Non-linear Loop Invariant Generation using Gröbner Bases
- POPL'04
, 2004
"... We present a new technique for the generation of non-linear (algebraic) invariants of a program. Our technique uses the theory of ideals over polynomial rings to reduce the non-linear invariant generation problem to a numerical constraint solving problem. So far, the literature on invariant generati ..."
Abstract
- Add to MetaCart
of constraints, such that all the solutions to these constraints correspond to non-linear (algebraic) loop invariants of the program. We discuss some trade-offs between the completeness of the technique and the tractability of the constraint-solving problem generated. The application of the technique
Comment on: “Bayesian Computation Using Design of Experiments-based Interpolation Technique”
, 2012
"... The author is to be commended on the development of this new piece of methodology, which they name DoIt. We believe that the method, or later versions of the method, has the potential to be an important element in the kit-bag of non-MCMC based methods for approximate Bayesian inference. Throughout t ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
The author is to be commended on the development of this new piece of methodology, which they name DoIt. We believe that the method, or later versions of the method, has the potential to be an important element in the kit-bag of non-MCMC based methods for approximate Bayesian inference. Throughout
Models in science’,
- The Stanford Encyclopedia of Philosophy. The Metaphysics Research Lab,
, 2008
"... Models are of central importance in many scientific contexts. The centrality of models such as the billiard ball model of a gas, the Bohr model of the atom, the MIT bag model of the nucleon, the Gaussian-chain model of a polymer, the Lorenz model of the atmosphere, the Lotka-Volterra model of preda ..."
Abstract
-
Cited by 21 (1 self)
- Add to MetaCart
Models are of central importance in many scientific contexts. The centrality of models such as the billiard ball model of a gas, the Bohr model of the atom, the MIT bag model of the nucleon, the Gaussian-chain model of a polymer, the Lorenz model of the atmosphere, the Lotka-Volterra model
The Inductive Inference of Cyclic Synchronized Interleaving
- In Proceedings of the 11th European Conference on Artificial Intelligence
, 1994
"... An inductive inference algorithm for inferring cyclic interleaving expressions from homing sequences is presented. The restricted language studied uses a synchronized interleaving or shuffle operator, which is an important component in algebraic theories of concurrency. Expressions of this language ..."
Abstract
-
Cited by 3 (3 self)
- Add to MetaCart
, this research shows that machine learning can be tractably applied towards concurrent computations. This may lead to new semi-automated methodologies founded in machine learning technology for synthesizing and testing concurrent and distributed systems.
Continuous and spatial extension of stochastic π-calculus Final Year
"... In this project, we work towards a continuous and spatial extension of stochastic π calculus. The continuous semantics is a useful alternative to the discrete semantics and has been recently provided for other process algebras. Ability to express spatial properties of the models is an important prac ..."
Abstract
- Add to MetaCart
In this project, we work towards a continuous and spatial extension of stochastic π calculus. The continuous semantics is a useful alternative to the discrete semantics and has been recently provided for other process algebras. Ability to express spatial properties of the models is an important
Results 11 - 20
of
37