نتایج جستجو برای: moderate pruning and 3

تعداد نتایج: 17105434  

2004
Tobias Brüggemann Walter Kern

We slightly improve the pruning technique presented in Dantsin et. al. (2002) to obtain an O∗ (1.473n) algorithm for 3-SAT.

2012
Siri Vestheim Jan Tommy Gravdahl

Radial Basis Function Neural Networks are well suited for learning the system dynamics of a robot manipulator and implementation of these networks in the control scheme for a manipulator is a good way to deal with the system uncertainties and modeling errors which often occur. The problem with RBF networks however is to find a network with suitable size, not too computational demanding and able...

2004
Henrik Boström

Incremental reduced error pruning is a technique that has been extensively used for efficient induction of ordered rule sets (decision lists). Several criteria have been developed regarding how to prune rules and whether or not to exclude generated rules. A version of incremental reduced error pruning for unordered rule sets is presented, and the appropriateness of previously proposed criteria ...

Journal: :ICGA Journal 1998
David Carmel Shaul Markovitch

The Multi-model search framework generalizes minimax to allow exploitation of recursive opponent models. In this work we consider adding pruning to the multi-model search. We prove a sufficient condition that enables pruning and describe two pruning algorithms, αβ∗ and αβ∗ 1p. We prove correctness and optimality of the algorithms and provide an experimental study of their pruning power. We show...

1995
Jonathan J. Oliver David J. Hand

Pruning a decision tree is considered by some researchers to be the most important part of tree building in noisy domains. While, there are many approaches to pruning, an alternative approach of averaging over decision trees has not received as much attention. We perform an empirical comparison of pruning with the approach of averaging over decision trees. For this comparison we use a computa-t...

1997
David D. Jensen Matthew D. Schmill

Introduction Bonferroni Pruning Pruning is a common technique to avoid over tting in decision trees. Most pruning techniques do not account for one important factor | multiple comparisons. Multiple comparisons occur when an induction algorithm examines several candidate models and selects the one that best accords with the data. Making multiple comparisons produces incorrect inferences about mo...

Journal: :Medical hypotheses 2011
Prasanna N De Silva

All effective anti psychotic drugs block glucose transporter proteins (GLUTs), peripherally and in the brain. These drugs are implicated in hyperglycaemia as demonstrated in mouse and human studies. Clozapine is the strongest blocker, with Haloperidol the weakest. The GLUT hypothesis suggests that schizophrenia is partly due to poor functioning of brain glucose transporters (GLUT 1 and 3). Neur...

2016
Mark A. Hallen Jonathan D. Jou Bruce R. Donald

Section A describes the least-squares method used to calculate the LUTE matrix. Section B describes what terms need to be included in the energy matrix. Each term corresponds to a tuple of RCs at di↵erent positions. Section C describes how a pruning interval, a parameter used for pruning in continuously flexible designs, can be computed for several types of LUTE calculations. Section D provides...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید