658 search results - page 105 / 132 » Partially Ordered Constraint Optimization Problems |
165
click to vote
RSS
2007
15 years 7 months ago
2007
— Multi-robot systems require efficient and accurate planning in order to perform mission-critical tasks. However, algorithms that find the optimal solution are usually computa...
194
click to vote
SIAMJO
2010
15 years 20 days ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
153
click to vote
RTCSA
1999
IEEE
15 years 10 months ago
1999
IEEE
In this paper; we describe optimal algorithmsfor incorporating error recovery in the imprecise computation model. In that model eack task compriser a mandatory and an optional par...
171
click to vote
ATAL
2007
Springer
16 years 3 days ago
2007
Springer
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
155
click to vote
ECML
2005
Springer
15 years 11 months ago
2005
Springer
Spectral methods for embedding graphs and immersing data manifolds in low-dimensional speaces are notoriously unstable due to insufficient and/or numberically ill-conditioned con...