510 search results - page 32 / 102 » Complexity measures and decision tree complexity: a survey |
PLANX
2007
13 years 10 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
SIAMCOMP
2000
13 years 8 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
KI
2007
Springer
13 years 8 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...
INFORMATICALT
2010
13 years 3 months ago
2010
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...
FUIN
2002
13 years 8 months ago
2002
We use information entropy measure to extend the rough set based notion of a reduct. We introduce the Approximate Entropy Reduction Principle (AERP). It states that any simplificat...