Results 1  10
of
3,165
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannon
ADEPT flex  Supporting Dynamic Changes of Workflows Without Loosing Control
 Journal of Intelligent Information Systems
, 1998
"... . Today's workflow management systems (WFMSs) are only applicable in a secure and safe manner if the business process (BP) to be supported is wellstructured and there is no need for ad hoc deviations at runtime. As only few BPs are static in this sense, this significantly limits the applicabil ..."
Abstract

Cited by 425 (112 self)
 Add to MetaCart
. Today's workflow management systems (WFMSs) are only applicable in a secure and safe manner if the business process (BP) to be supported is wellstructured and there is no need for ad hoc deviations at runtime. As only few BPs are static in this sense, this significantly limits
SUS: A quick and dirty usability scale
, 1996
"... Usability does not exist in any absolute sense; it can only be defined with reference to particular contexts. This, in turn, means that there are no absolute measures of usability, since, if the usability of an artefact is defined by the context in which that artefact is used, measures of usability ..."
Abstract

Cited by 397 (1 self)
 Add to MetaCart
Usability does not exist in any absolute sense; it can only be defined with reference to particular contexts. This, in turn, means that there are no absolute measures of usability, since, if the usability of an artefact is defined by the context in which that artefact is used, measures of usability
Completing description logic knowledge bases using formal concept analysis
 In Proc. of IJCAI 2007
, 2007
"... We propose an approach for extending both the terminological and the assertional part of a Description Logic knowledge base by using information provided by the knowledge base and by a domain expert. The use of techniques from Formal Concept Analysis ensures that, on the one hand, the interaction wi ..."
Abstract

Cited by 80 (7 self)
 Add to MetaCart
with the expert is kept to a minimum, and, on the other hand, we can show that the extended knowledge base is complete in a certain, welldefined sense. 1
2009a): “Refined bestresponse correspondence and dynamics,” mimeo. (2009b): “The refined bestresponse correspondence in extensive form games,” mimeo
"... We study a natural (and, in a welldefined sense, minimal) refinement of the bestreply correspondence. Its fixed points, notions of rationalizability and CURB sets based on this correspondence are defined and characterized. Finally minimally asymptotically stable faces under the induced refined bes ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We study a natural (and, in a welldefined sense, minimal) refinement of the bestreply correspondence. Its fixed points, notions of rationalizability and CURB sets based on this correspondence are defined and characterized. Finally minimally asymptotically stable faces under the induced refined
Probabilistic analysis of the generalised assignment problem
, 1999
"... We analyse the generalised assignment problem under the assumption that all coefficients are drawn uniformly and independently from [0,1]. We show that such problems can be solved exactly with high probability, in a welldefined sense. The results are closely related to earlier work of Lueker, Goldb ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We analyse the generalised assignment problem under the assumption that all coefficients are drawn uniformly and independently from [0,1]. We show that such problems can be solved exactly with high probability, in a welldefined sense. The results are closely related to earlier work of Lueker
Fast Monte Carlo Algorithms for Matrices II: Computing a LowRank Approximation to a Matrix
 SIAM JOURNAL ON COMPUTING
, 2004
"... ... matrix A. It is often of interest to find a lowrank approximation to A, i.e., an approximation D to the matrix A of rank not greater than a specified rank k, where k is much smaller than m and n. Methods such as the Singular Value Decomposition (SVD) may be used to find an approximation to A ..."
Abstract

Cited by 216 (20 self)
 Add to MetaCart
to A which is the best in a well defined sense. These methods require memory and time which are superlinear in m and n; for many applications in which the data sets are very large this is prohibitive. Two simple and intuitive algorithms are presented which, when given an m n matrix A, compute a
Expected Utility Theory without the Completeness Axiom
 JOURNAL OF ECONOMIC THEORY, VOLUME 115, ISSUE 1
, 2004
"... We study the problem of obtaining an expected utility representation for a potentially incomplete preference relation over lotteriesby meansof a set of von Neumann–Morgenstern utility functions. It is shown that, when the prize space is a compact metric space, a preference relation admits such a mul ..."
Abstract

Cited by 48 (8 self)
 Add to MetaCart
multiutility representation provided that it satisfies the standard axioms of expected utility theory. Moreover, the representing set of utilities is unique in a welldefined sense.
Approximate identification of automata
 Electronics Letters
, 1975
"... A technique is described for the identification of probabilistic and other nondeterministic automata from sequences of their input/output behaviour. For a given number of states the models obtained are optimal in well defined senses, one related to leastmeansquare approximation and the other to S ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
A technique is described for the identification of probabilistic and other nondeterministic automata from sequences of their input/output behaviour. For a given number of states the models obtained are optimal in well defined senses, one related to leastmeansquare approximation and the other
Model Minimization in Markov Decision Processes
 In Proceedings of the Fourteenth National Conference on Artificial Intelligence
, 1997
"... We use the notion of stochastic bisimulation homogeneity to analyze planning problems represented as Markov decision processes (MDPs). Informally, a partition of the state space for an MDP is said to be homogeneous if for each action, states in the same block have the same probability of being ..."
Abstract

Cited by 122 (8 self)
 Add to MetaCart
of being carried to each other block. We provide an algorithm for finding the coarsest homogeneous refinement of any partition of the state space of an MDP. The resulting partition can be used to construct a reduced MDP which is minimal in a well defined sense and can be used to solve the original
Results 1  10
of
3,165