Sciweavers

240 search results - page 25 / 48
» On the numerical solution to linear problems using stochasti...
Sort
View
JMLR
2008
209views more  JMLR 2008»
14 years 9 months ago
Bayesian Inference and Optimal Design for the Sparse Linear Model
The linear model with sparsity-favouring prior on the coefficients has important applications in many different domains. In machine learning, most methods to date search for maxim...
Matthias W. Seeger
NHM
2010
87views more  NHM 2010»
14 years 4 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...
COMPUTING
2010
14 years 7 months ago
Modified HSS iteration methods for a class of complex symmetric linear systems
In this paper, we introduce and analyze a modification of the Hermitian and skewHermitian splitting iteration method for solving a broad class of complex symmetric linear systems....
Zhong-Zhi Bai, Michele Benzi, Fang Chen
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
15 years 10 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
106
Voted
ECP
1997
Springer
128views Robotics» more  ECP 1997»
15 years 1 months ago
SINERGY: A Linear Planner Based on Genetic Programming
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
Ion Muslea