Sciweavers

1486 search results - page 269 / 298
» Mathematical Fuzzy Logics
Sort
View
JCST
2010
189views more  JCST 2010»
14 years 6 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
TCOM
2010
168views more  TCOM 2010»
14 years 6 months ago
A unified analysis of routing protocols in MANETs
This paper presents a mathematical framework for the evaluation of the performance of proactive and reactive routing protocols in mobile ad hoc networks (MANETs). This unified fram...
Hui Xu, Xianren Wu, Hamid R. Sadjadpour, J. J. Gar...
CCA
2009
Springer
15 years 3 months ago
Effective Choice and Boundedness Principles in Computable Analysis
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
Vasco Brattka, Guido Gherardi
SAC
2010
ACM
15 years 6 months ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil
PPDP
2005
Springer
15 years 5 months ago
ReactiveML: a reactive extension to ML
We present ReactiveML, a programming language dedicated to the implementation of complex reactive systems as found in graphical user interfaces, video games or simulation problems...
Louis Mandel, Marc Pouzet