510 search results - page 38 / 102 » Complexity measures and decision tree complexity: a survey |
CORR
2012
Springer
12 years 4 months ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
ACG
2009
Springer
14 years 3 months ago
2009
Springer
The chess endgame is increasingly being seen through the lens of, and therefore effectively defined by, a data ‘model’ of itself. It is vital that such models are clearly faith...
JAIR
2008
13 years 8 months ago
2008
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
VISSOFT
2005
IEEE
14 years 2 months ago
2005
IEEE
Dominance analysis from graph theory allows one to locate subordinated software elements in a rooted dependency graph. It identifies the nesting structure for a dependency graph ...
ATVA
2007
Springer
14 years 2 months ago
2007
Springer
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...