283 search results - page 34 / 57 » Deterministic Polynomial Time Algorithms for Matrix Completi... |
111
Voted
ICRA
2008
IEEE
15 years 8 months ago
2008
IEEE
— Modeling robot motion planning with uncertainty in a Bayesian framework leads to a computationally intractable stochastic control problem. We seek hypotheses that can justify a...
126
click to vote
EPIA
1993
Springer
15 years 6 months ago
1993
Springer
Abstract. This work presents a constraint solver for the domain of rational trees. Since the problem is NP-hard the strategy used by the solver is to reduce as much as possible, in...
AAAI
2006
15 years 3 months ago
2006
As embedded systems grow increasingly complex, there is a pressing need for diagnosing and monitoring capabilities that estimate the system state robustly. This paper is based on ...
94
Voted
IPPS
1997
IEEE
15 years 6 months ago
1997
IEEE
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...
186
click to vote
CP
2011
Springer
14 years 1 months ago
2011
Springer
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...