Sciweavers

1477 search results - page 145 / 296
» Random Convex Programs
Sort
View
TIT
2010
158views Education» more  TIT 2010»
13 years 3 months ago
Belief propagation, Dykstra's algorithm, and iterated information projections
Belief propagation is shown to be an instance of a hybrid between two projection algorithms in the convex programming literature: Dykstra's algorithm with cyclic Bregman proje...
John MacLaren Walsh, Phillip A. Regalia
CORR
2011
Springer
155views Education» more  CORR 2011»
13 years 22 days ago
On the Generation of Positivstellensatz Witnesses in Degenerate Cases
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
David Monniaux, Pierre Corbineau
ICC
2007
IEEE
301views Communications» more  ICC 2007»
14 years 3 months ago
Network Lifetime Optimization by Duality Approach for Multi-Source and Single-Sink Topology in Wireless Sensor Networks
—The multi-source and single-sink (MSSS) topology, in wireless sensor networks, is defined as the network topology, where all of nodes can gather, receive and transmit data to t...
Hui Wang, Yuhang Yang, Maode Ma, Xiaomin Wang
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
13 years 10 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis
ISIPTA
2005
IEEE
130views Mathematics» more  ISIPTA 2005»
14 years 2 months ago
Computing Lower and Upper Expectations under Epistemic Independence
This papers investigates the computation of lower/upper expectations that must cohere with a collection of probabilistic assessments and a collection of judgements of epistemic in...
Cassio Polpo de Campos, Fabio Gagliardi Cozman