Sciweavers

4403 search results - page 298 / 881
» Galois Theory of Algorithms
Sort
View
ESANN
2006
15 years 8 months ago
Immune Network based Ensembles
This paper presents a new method for constructing ensembles of classifiers based on immune network theory, one of the most interesting paradigms within the field of artificial imm...
Nicolás García-Pedrajas, Colin Fyfe
UAI
1993
15 years 8 months ago
Probabilistic Assumption-Based Reasoning
In this paper the classical propositional assumption-based model is extended to incorporate probabilities for the assumptions. Then the whole model is placed into the framework of...
Jürg Kohlas, Paul-André Monney
APAL
2007
131views more  APAL 2007»
15 years 6 months ago
Bounded fixed-parameter tractability and reducibility
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
Rod Downey, Jörg Flum, Martin Grohe, Mark Wey...
JCIT
2010
148views more  JCIT 2010»
15 years 1 months ago
Investigating the Performance of Naive- Bayes Classifiers and K- Nearest Neighbor Classifiers
Probability theory is the framework for making decision under uncertainty. In classification, Bayes' rule is used to calculate the probabilities of the classes and it is a bi...
Mohammed J. Islam, Q. M. Jonathan Wu, Majid Ahmadi...
TIM
2010
144views Education» more  TIM 2010»
15 years 1 months ago
Extending Polynomial Chaos to Include Interval Analysis
Polynomial chaos theory (PCT) has been proven to be an efficient and effective way to represent and propagate uncertainty through system models and algorithms in general. In partic...
Antonello Monti, Ferdinanda Ponci, Marco Valtorta