4843 search results - page 356 / 969 » The Shortcut Problem - Complexity and Approximation |
209
click to vote
ICDCIT
2012
Springer
13 years 12 months ago
2012
Springer
Abstract. A key challenge in multi-robot teaming research is determining how to properly enable robots to make decisions on actions they should take to contribute to the overall sy...
106
click to vote
CISS
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract— Costas array enumeration is an NP-complete problem with a highly parallelize-able solution. This paper examines the implementation of a solution to this problem on an F...
123
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We consider a regression problem where target values are given as intervals, and propose a statistical approach to it. Although it is hard to solve the optimization problem direct...
123
click to vote
WEA
2005
Springer
15 years 10 months ago
2005
Springer
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
143
click to vote
UAI
2001
15 years 5 months ago
2001
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...