167 search results - page 3 / 34 » A class of polynomially solvable linear complementarity prob... |
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
— This paper formulates and investigates a novel problem called Mutual Localization with Anonymous Position Measures. This is an extension of Mutual Localization with Position Me...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
Recent work has led to the development of an elegant theory of Linearly Solvable Markov Decision Processes (LMDPs) and related Path-Integral Control Problems. Traditionally, LMDPs...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
SAT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In this paper we study NP-hard weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...
DISOPT
2008
13 years 7 months ago
2008
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time ...