Results 41 to 50 of about 81,087 (166)
Tree models: a Bayesian perspective
, 2006 Submitted in partial fulfilment of the requirements for the degree of Master of Philosophy at Queen Mary, University of London, November 2006Classical tree models represent an attempt to create nonparametric models which have good predictive powers as ...
Egan, Blaise
core
Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation [PDF]
This paper presents a robust branch-cut-and-price algorithm for the Capacitated Minimum Spanning Tree Problem (CMST). The variables are associated to q-arbs, a structure that arises from a relaxation of the capacitated prize-collecting arbores- cence ...
Pessoa, Artur +5 more
core
CoRRPandora temporal fault tree, as one notable extension of the fault tree, introduces temporal gates and temporal laws. Pandora Temporal Fault Tree(TFT) enhances the capability of fault trees and enables the modeling of system failure behavior that depends on sequences.
Hitesh Khungla, Mohit Kumar
openaire +2 more sources
The Bird Core for Minimum Cost Spanning Tree problems Revisited: Monotonicity and Additivity Aspects
A new way is presented to define for minimum cost spanning tree (mcst-) games the irreducible core, which is introduced by Bird in 1976.The Bird core correspondence turns out to have interesting monotonicity and additivity properties and each stable cost
Moretti, S. +3 more
core
Genetic Algorithm for Object Oriented Reducts Using Rough Set Theory [PDF]
, 2010 Knowledge reduction is NP-hard problem. Many approaches are proposed to get the minimal reduction, which is mainly based on the significance of the attributes. There are some disadvantages of the reduction algorithms at present. In this paper,.
T Srikanth +3 more
core
Weighted Component Fairness for Forest Games
We present the axiom of weighted component fairness for the class of forest games, a generalization of component fairness introduced by Herings, Talman and van der Laan (2008) in order to characterize the average tree solution. Given a system of weights,
Solal, Philippe +2 more
core
Rough set methodology in meta-analysis - a comparative and exploratory analysis [PDF]
We study the applicability of the pattern recognition methodology "rough set data analysis" (RSDA) in the field of meta analysis. We give a summary of the mathematical and statistical background and then proceed to an application of the theory to a meta ...
Rupp, Thomas
core
DAKS: An R Package for Data Analysis Methods in Knowledge Space Theory
Knowledge space theory is part of psychometrics and provides a theoretical framework for the modeling, assessment, and training of knowledge. It utilizes the idea that some pieces of knowledge may imply others, and is based on order and set theory.
Anatol Sargin, Ali Ünlü
core
Extracting the Rules of KPIs for Equipment Management Based on Rough Set Theory
, 2015 [[abstract]]This paper practically collects manufacturing supplier dataset in Taiwan. The dataset includes production records, and there are 18 attributes such as production scheduling, scheduled downtime, process, etc.
王佳文;Wang, Jia Wen;Cheng, Ching Hsue
core
The P-Value for Cost Sharing in Minimum Cost Spanning Tree Situations
The aim of this paper is to introduce and axiomatically characterize the P-value as a rule to solve the cost sharing problem in minimum cost spanning tree (mcst) situations.The P-value is related to the Kruskal algorithm for finding an mcst.Moreover, the
Moretti, S. +3 more
core