1095 search results - page 16 / 219 » Preprocessing of Intractable Problems |
IPL
2007
13 years 7 months ago
2007
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...
KR
2010
Springer
14 years 14 days ago
2010
Springer
Cardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming. Clearly, all common algorithmic tasks relat...
NIPS
2007
13 years 9 months ago
2007
The learning of probabilistic models with many hidden variables and nondecomposable dependencies is an important and challenging problem. In contrast to traditional approaches bas...
NIPS
2004
13 years 9 months ago
2004
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
CP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Constraint propagation is one of the techniques central to the success of constraint programming. Fast algorithms are used to prune the search space either before or duri...