Search results for "Probabilistic analysis"

showing 3 items of 23 documents

How to simulate free will in a computational device

1999

Since we believe that human brain is not a purely deterministic device merely reacting to the environment but rather it is capable to a free will, Theoretical Computer Science has also tried to develop a system of notions generalizing determinism. Nondeterministic and probabilistic algorithms were the first generalizations. Nondeterministic machines constitute an important part of the Theory of Computation. Nondeterminism is a useful way to describe possible choices. In real life there are many regulations restricting our behavior. These regulations nearly always leave some freedom for us how to react. Such regulations are best described in terms of nondeterministic algorithms. Nondetermini…

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESTheoretical computer scienceProperty (philosophy)General Computer ScienceComputer scienceProbabilistic logicDeterminismTheoretical Computer ScienceMoment (mathematics)Nondeterministic algorithmTuring machinesymbols.namesakeTheory of computationsymbolsProbabilistic analysis of algorithmsACM Computing Surveys
researchProduct

CN2-R: Faster CN2 with randomly generated complexes

2011

Among the rule induction algorithms, the classic CN2 is still one of the most popular ones; a great amount of enhancements and improvements to it is to witness this. Despite the growing computing capacities since the algorithm was proposed, one of the main issues is resource demand. The proposed modification, CN2-R, substitutes the star concept of the original algorithm with a technique of randomly generated complexes in order to substantially improve on running times without significant loss in accuracy.

Weighted Majority AlgorithmTheoretical computer scienceRule inductionComputer sciencePopulation-based incremental learningStability (learning theory)Online machine learningProbabilistic analysis of algorithmsAlgorithm designStar (graph theory)Algorithm2011 16th International Conference on Methods & Models in Automation & Robotics
researchProduct

Probabilistic Logic under Coherence: Complexity and Algorithms

2005

In previous work [V. Biazzo, A. Gilio, T. Lukasiewicz and G. Sanfilippo, Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in System P, Journal of Applied Non-Classical Logics 12(2) (2002) 189---213.], we have explored the relationship between probabilistic reasoning under coherence and model-theoretic probabilistic reasoning. In particular, we have shown that the notions of g-coherence and of g-coherent entailment in probabilistic reasoning under coherence can be expressed by combining notions in model-theoretic probabilistic reasoning with concepts from default reasoning. In this paper, we continue this line of research. Based on the above sem…

conditional probability assessmentSettore MAT/06 - Probabilita' E Statistica MatematicaDivergence-from-randomness modelalgorithmsprobabilistic logicConditional probability assessments; probabilistic logic; g-coherence; g-coherent entailment; complexity and algorithms.Artificial IntelligenceProbabilistic logic networkprobabilistic logic under coherenceConditional probability assessmentsProbabilistic analysis of algorithmsNon-monotonic logicconditional constraintMathematicsg-coherent entailmentConditional probability assessments probabilistic logic g-coherence g-coherent entailment complexity and algorithms.Reasoning systemcomputational complexitymodel-theoretic probabilistic logicApplied Mathematicscomplexity and algorithmsProbabilistic logiclogical constraintProbabilistic argumentationg-coherenceconditional probability assessment logical constraint conditional constraint probabilistic logic under coherence model-theoretic probabilistic logic g-coherence g-coherent entailment computational complexity algorithmsProbabilistic CTLalgorithms; computational complexity; conditional constraint; conditional probability assessment; g-coherence; g-coherent entailment; logical constraint; model-theoretic probabilistic logic; probabilistic logic under coherenceAlgorithmAnnals of Mathematics and Artificial Intelligence
researchProduct