14548 search results - page 433 / 2910 » The Optimal Path-Matching Problem |
195
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
When agents need to interact in order to solve some (possibly common) problem, resolving potential conflicts beforehand is often preferred to coordination during execution. Agents...
212
click to vote
WEA
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
216
click to vote
ICASSP
2009
IEEE
16 years 2 months ago
2009
IEEE
The LCD deblurring problem is considered as a simple bounded quadratic programming problem and is solved using conjugate gradient with early stopping criteria to avoid excessive s...
195
click to vote
ALGORITHMICA
2008
15 years 7 months ago
2008
We consider the problem of approximately integrating a Lipschitz function f (with a known Lipschitz constant) over an interval. The goal is to achieve an error of at most using as...
203
click to vote
MP
2008
15 years 7 months ago
2008
In this paper we discuss computational complexity and risk averse approaches to two and multistage stochastic programming problems. We argue that two stage (say linear) stochastic ...