Results 1  10
of
211
Using Weighted MaxSat Engines to Solve MPE
 Proc. 18th Nat’l Conf. Artificial Intelligence
, 2002
"... Logical and probabilistic reasoning are closely related. Many examples in each group have natural analogs in the other. One example is the strong relationship between weighted MAXSAT and MPE. This paper presents a simple reduction of MPE to weighted MAXSAT. It also investigates approximating MPE b ..."
Abstract

Cited by 49 (0 self)
 Add to MetaCart
Logical and probabilistic reasoning are closely related. Many examples in each group have natural analogs in the other. One example is the strong relationship between weighted MAXSAT and MPE. This paper presents a simple reduction of MPE to weighted MAXSAT. It also investigates approximating MPE
PRELIMINARY AND INCOMPLETE
"... This paper proposes a way to quantify expected profits and risk to model based trading strategies. A positive portfolio weight is assigned to assets which market prices exceed the price of a theoretical asset pricing model. The position is smaller, ceteris paribus, if the theoretical asset price is ..."
Abstract
 Add to MetaCart
is sensitive to model parameters subject to estimation uncertainty. Standard meanvariance analysis is used to construct optimal model based portfolio weights. In essence, these portfolio rules allow estimation risk, as well as price risk to be approximately hedged. The strategy is applied to S&P 500 index
Approximate Inverse Preconditioners Via SparseSparse Iterations
, 1998
"... . The standard incomplete LU (ILU) preconditioners often fail for general sparse indefinite matrices because they give rise to `unstable' factors L and U . In such cases, it may be attractive to approximate the inverse of the matrix directly. This paper focuses on approximate inverse preconditi ..."
Abstract

Cited by 85 (17 self)
 Add to MetaCart
. The standard incomplete LU (ILU) preconditioners often fail for general sparse indefinite matrices because they give rise to `unstable' factors L and U . In such cases, it may be attractive to approximate the inverse of the matrix directly. This paper focuses on approximate inverse
Social conformity and approximate purification in games with incomplete information.
, 2002
"... Interpret a set of players with similar attributes who are all playing the same strategy as a society. Is it consistent with selfinterested behaviour for a population to organise itself into a relatively small number of societies? By introducing a framework of approximate substitutes in noncoope ..."
Abstract
 Add to MetaCart
Interpret a set of players with similar attributes who are all playing the same strategy as a society. Is it consistent with selfinterested behaviour for a population to organise itself into a relatively small number of societies? By introducing a framework of approximate substitutes in non
Finite Approximations to a ZeroSum Game With Incomplete Information
"... Abstract: In this paper, we investigate a scheme for approximating a twoperson zerosum game G of incomplete information by means of a natural system Gmn of its finite subgames. The main question is: For large m and n, is an optimal strategy for Gmn necessarily an eoptimal strategy for G? ..."
Abstract
 Add to MetaCart
Abstract: In this paper, we investigate a scheme for approximating a twoperson zerosum game G of incomplete information by means of a natural system Gmn of its finite subgames. The main question is: For large m and n, is an optimal strategy for Gmn necessarily an eoptimal strategy for G?
A COMPUTATIONAL SCHEME FOR THE OPTIMAL STRATEGY IN AN INCOMPLETE MARKET
"... Abstract. We examine the optimal portfolio selection problem of a single agent who receives an unhedgeable endowment. The agent wishes to optimize his/her logutility derived from his/her terminal wealth. We do not solve this problem analytically but construct a recursive computational algorithm whi ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
which approximates the optimal one. We present an “intelligent ” initial portfolio which requires, numerically, about 25 % fewer corrective steps in the algorithm than a random initial portfolio, and outperforms the portfolio which ignores the unhedgeable risk of the endowment.
Learning to Forgive * PRELIMINARY AND INCOMPLETE
"... Abstract If players learn to play an infinitely repeated game using Foster and Young's (Games and Economic Behavior 45, 2003, 7396) hypothesis testing, then their strategies almost always approximate equilibria of the repeated game. If, in addition, they are sufficiently "conservative& ..."
Abstract
 Add to MetaCart
Abstract If players learn to play an infinitely repeated game using Foster and Young's (Games and Economic Behavior 45, 2003, 7396) hypothesis testing, then their strategies almost always approximate equilibria of the repeated game. If, in addition, they are sufficiently "
Original article Solving animal model equations through an approximate incomplete
, 1991
"... Summary A general strategy is described for the design of more efficient algorithms to solve the large linear systems Bs = r arising in (individual) animal model evaluations. This strategy, like GaussSeidel iteration, belongs to the family of &dquo;splitting methods&dquo; based on the deco ..."
Abstract
 Add to MetaCart
on the decomposition B = B * + (B B*), but, in contrast to other methods, it tries to take maximum advantage of the known sparsity structure of the mixed model coefficient matrix: B * is chosen to be an approximate incomplete Cholesky factor of B. The resulting procedure requires the solution of 2 triangular systems
PRELIMINARY AND INCOMPLETE, Comments Welcome
, 2009
"... ABSTRACT ———————————————————————————————————— Quantitative results from a large class of structural gravity models of international trade depend critically on a single parameter governing the elasticity of trade with respect to trade frictions. We provide a new method to estimate this elasticity and ..."
Abstract
 Add to MetaCart
and illustrate the merits of our approach relative to the estimation strategy of Eaton and Kortum (2002). We employ this method on data for 123 developed and developing countries for the year 2004 using new disaggregate price and trade flow data. Our benchmark estimate for all countries is approximately 4
On the existence problem of incomplete
, 1999
"... Abstract Incomplete factorisation methods can suffer from breakdown in that they may give zero or negative pivots where an exact factorisation would show only positive pivots. This breakdown effectively prevents the factorisation from being used in iterative methods such as Conjugate Gradients. We g ..."
Abstract
 Add to MetaCart
give an overview of strategies that have been proposed to prevent this breakdown, and we touch briefly on various related issues in incomplete factorisations. 1 Introduction For the efficient solution of sparse linear systems Au = b by an iterative method, the choice of a proper preconditioner
Results 1  10
of
211