1920 search results - page 31 / 384 » The Complexity of the A B C Problem |
160
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
154
click to vote
UAI
2008
15 years 7 months ago
2008
While known algorithms for sensitivity analysis and parameter tuning in probabilistic networks have a running time that is exponential in the size of the network, the exact comput...
151
click to vote
4OR
2004
15 years 5 months ago
2004
This paper considers packing problems with balancing conditions and items consisting of clusters of parallelepipeds (mutually orthogonal, i.e. tetris-like items). This issue is qu...
145
click to vote
4OR
2005
15 years 5 months ago
2005
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
112
click to vote
ICMCS
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper, we present an efficient 3D shape rejection algorithm for unlabeled 3D markers. The problem is important in domains such as rehabilitation and the performing arts. T...