Sciweavers

1640 search results - page 37 / 328
» Conditional Independence Trees
Sort
View
JSYML
2007
106views more  JSYML 2007»
13 years 9 months ago
Characterizing rosy theories
We examine several conditions, either the existence of a rank or a particular property of þ-forking that suggest the existence of a well-behaved independence relation, and determi...
Clifton Ealy, Alf Onshuus
CP
2011
Springer
12 years 9 months ago
Pruning Rules for Constrained Optimisation for Conditional Preferences
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
Nic Wilson, Walid Trabelsi
ATAL
2010
Springer
13 years 11 months ago
Learning context conditions for BDI plan selection
An important drawback to the popular Belief, Desire, and Intentions (BDI) paradigm is that such systems include no element of learning from experience. In particular, the so-calle...
Dhirendra Singh, Sebastian Sardiña, Lin Pad...
MCETECH
2009
Springer
14 years 4 months ago
A Non-technical User-Oriented Display Notation for XACML Conditions
Access control rules are currently administered by highly qualified personnel. Thus, the technical barrier that specialized access control languages represent naturally prevents th...
Bernard Stepien, Amy P. Felty, Stan Matwin
PAMI
1998
127views more  PAMI 1998»
13 years 9 months ago
The Random Subspace Method for Constructing Decision Forests
—Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is ...
Tin Kam Ho