1651 search results - page 49 / 331 » Measuring the Complexity of Classification Problems |
AAAI
1998
13 years 9 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
IWPEC
2004
Springer
14 years 1 months ago
2004
Springer
Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining use...
ACMSE
2000
ACM
14 years 3 days ago
2000
ACM
We present the background and justi cation for a new approachto studying computation and computational complexity. We focus on categories of problems and categories of solutions w...
KI
2007
Springer
13 years 7 months ago
2007
Springer
We present an approximation method that solves a class of Decentralized hybrid Markov Decision Processes (DEC-HMDPs). These DEC-HMDPs have both discrete and continuous state variab...
EAAI
2007
13 years 7 months ago
2007
This paper recapitulates the results of a long research on a family of artificial intelligence (AI) methods—relying on, e.g., artificial neural networks and search techniques...