510 search results - page 38 / 102 » Complexity measures and decision tree complexity: a survey |
167
click to vote
CORR
2012
Springer
14 years 1 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...
115
Voted
ACG
2009
Springer
16 years 21 days 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...
155
click to vote
JAIR
2008
15 years 6 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...
149
click to vote
VISSOFT
2005
IEEE
15 years 11 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 ...
184
click to vote
ATVA
2007
Springer
16 years 8 days 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...