Sciweavers

Share
MASCOTS
1994
8 years 8 months ago
Xmgm: Performance Modeling Using Matrix Geometric Techniques
Over the last two decades a considerable amount of effort has been put in the development and application of matrix geometric techniques for the analysis of queueing systems of wh...
Boudewijn R. Haverkort, Aad P. A. van Moorsel, Dir...
AIPS
1996
8 years 8 months ago
Event-Based Decompositions for Reasoning about External Change in Planners
An increasing number of planners can handle uncertainty in the domain or in action outcomes. However, less work has addressed building plans when the planner's world can chan...
Jim Blythe
WSC
1998
8 years 8 months ago
Stopping Criterion for a Simulation-Based Optimization Method
We consider a new simulation-based optimization method called the Nested Partitions (NP) method. This method generates a Markov chain and solving the optimization problem is equiv...
Sigurdur Ólafsson, Leyuan Shi
NIPS
2003
8 years 8 months ago
Wormholes Improve Contrastive Divergence
In models that define probabilities via energies, maximum likelihood learning typically involves using Markov Chain Monte Carlo to sample from the model’s distribution. If the ...
Geoffrey E. Hinton, Max Welling, Andriy Mnih
MASCOTS
2004
8 years 8 months ago
Dual-Processor Parallelisation of Symbolic Probabilistic Model Checking
In this paper, we describe the dual-processor parallelisation of a symbolic (BDD-based) implementation of probabilistic model checking. We use multi-terminal BDDs, which allow a c...
Marta Z. Kwiatkowska, David Parker, Yi Zhang, Rash...
NIPS
2007
8 years 8 months ago
Markov Chain Monte Carlo with People
Many formal models of cognition implicitly use subjective probability distributions to capture the assumptions of human learners. Most applications of these models determine these...
Adam Sanborn, Thomas L. Griffiths
IJCAI
2007
8 years 8 months ago
r-grams: Relational Grams
We introduce relational grams (r-grams). They upgrade n-grams for modeling relational sequences of atoms. As n-grams, r-grams are based on smoothed n-th order Markov chains. Smoot...
Niels Landwehr, Luc De Raedt
ECAI
2008
Springer
8 years 9 months ago
A probabilistic analysis of diagnosability in discrete event systems
Abstract. This paper shows that we can take advantage of information about the probabilities of the occurrences of events, when this information is available, to refine the classic...
Farid Nouioua, Philippe Dague
WSC
2008
8 years 9 months ago
Speeding up call center simulation and optimization by Markov chain uniformization
Staffing and scheduling optimization in large multiskill call centers is time-consuming, mainly because it requires lengthy simulations to evaluate performance measures and their ...
Eric Buist, Wyean Chan, Pierre L'Ecuyer
BMVC
2001
8 years 9 months ago
Graph Matching using Adjacency Matrix Markov Chains
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...
Antonio Robles-Kelly, Edwin R. Hancock
books