Sciweavers

2694 search results - page 89 / 539
» Fully Distributed Algorithms for Convex Optimization Problem...
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Mixed norms with overlapping groups as signal priors
In a number of signal processing applications, problem formulations based on the 1 norm as a sparsity inducing signal prior lead to simple algorithms with good performance. Howeve...
Ilker Bayram
CP
2006
Springer
15 years 1 months ago
A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
Matthew J. Streeter, Stephen F. Smith
ATAL
2005
Springer
15 years 3 months ago
A distributed framework for solving the Multiagent Plan Coordination Problem
We examine whether and how the Multiagent Plan Coordination Problem, the problem of resolving interactions between the plans of multiple agents, can be cast as a Distributed Const...
Jeffrey S. Cox, Edmund H. Durfee, Thomas Bartold
CDC
2010
IEEE
117views Control Systems» more  CDC 2010»
14 years 4 months ago
Distributed iterative regularization algorithms for monotone Nash games
In this paper, we consider the development of single-timescale schemes for the distributed computation of Nash equilibria. In general, equilibria associated with convex Nash games ...
Aswin Kannan, Uday V. Shanbhag
AUSAI
2004
Springer
15 years 3 months ago
An ACO Algorithm for the Most Probable Explanation Problem
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
Haipeng Guo, Prashanth R. Boddhireddy, William H. ...