Sciweavers

63 search results - page 12 / 13
» The Complexity of Iterated Belief Revision
Sort
View
JAIR
2008
102views more  JAIR 2008»
13 years 7 months ago
An Ordinal Bargaining Solution with Fixed-Point Property
Shapley's impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Alth...
Dongmo Zhang, Yan Zhang
ICASSP
2009
IEEE
14 years 2 months ago
MIMO decoding based on stochastic reconstruction from multiple projections
Least squares (LS) fitting is one of the most fundamental techniques in science and engineering. It is used to estimate parameters from multiple noisy observations. In many probl...
Amir Leshem, Jacob Goldberger
AMAI
2004
Springer
14 years 22 days ago
New Look-Ahead Schemes for Constraint Satisfaction
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
Kalev Kask, Rina Dechter, Vibhav Gogate
CVPR
2012
IEEE
11 years 9 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
TACAS
2005
Springer
108views Algorithms» more  TACAS 2005»
14 years 24 days ago
On Some Transformation Invariants Under Retiming and Resynthesis
Transformations using retiming and resynthesis operations are the most important and practical (if not the only) techniques used in optimizing synchronous hardware systems. Althoug...
Jie-Hong Roland Jiang