3250 search results - page 131 / 650 » An Algorithm to Solve a Linear Program |
126
click to vote
AAAI
2006
15 years 6 months ago
2006
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
150
click to vote
IAT
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
150
Voted
NIPS
2008
15 years 6 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
161
click to vote
ICRA
2005
IEEE
15 years 10 months ago
2005
IEEE
— We present a fast method for solving rigid body contact problems with friction, based on optimizations incorporated into Lemke’s algorithm for solving linear complementarity ...
138
Voted
ICA
2004
Springer
15 years 10 months ago
2004
Springer
We consider the Blind Source Separation problem of linear mixtures with singular matrices and show that it can be solved if the sources are sufficiently sparse. More generally, we ...