9842 search results - page 1286 / 1969 » The Complexity of the Matching-Cut Problem |
177
click to vote
IROS
2007
IEEE
16 years 1 months ago
2007
IEEE
— Smoothing and optimization approaches are an effective means for solving the simultaneous localization and mapping (SLAM) problem. Most of the existing techniques focus mainly ...
208
click to vote
AI
2007
Springer
16 years 1 months ago
2007
Springer
DEC-POMDPs provide formal models of many cooperative multiagent problems, but their complexity is NEXP-complete in general. We investigate a sub-class of DEC-POMDPs termed multiage...
178
click to vote
CPAIOR
2007
Springer
16 years 1 months ago
2007
Springer
Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with mixed integer progra...
215
click to vote
CSL
2007
Springer
16 years 1 months ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
198
click to vote
DAGM
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. This contribution presents a novel approach to the challenging problem of model selection in motion estimation from sequences of images. New light is cast on parametric m...