Sciweavers

1943 search results - page 308 / 389
» Ordering Default Theories
Sort
View
JCST
2010
189views more  JCST 2010»
15 years 25 days 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
JDCTA
2010
172views more  JDCTA 2010»
15 years 25 days ago
A Method of Bearing Fault Feature Extraction Based on Improved Wavelet Packet and Hilbert Analysis
In order to supply a gap of current resonance vibration and STFT demodulation method applied to rolling bearing fault feature extraction of city rail vehicle, a fault diagnosis me...
Jian-wei Yang, De-chen Yao, Guo-qiang Cai, Hai-bo ...
JDCTA
2010
150views more  JDCTA 2010»
15 years 25 days ago
Proof as Composition: An approach for the Large-granularity Web Services Composition
The large-granularity Web services are a new form of Web services. In contrast to the traditional Web services, they often have more interfaces, encapsulate more complex business ...
Yuyu Yin, Ying Li, Jianwei Yin, ShuiGuang Deng
SBMF
2010
Springer
205views Formal Methods» more  SBMF 2010»
15 years 23 days ago
A High-Level Language for Modeling Algorithms and Their Properties
Designers of concurrent and distributed algorithms usually express them using pseudo-code. In contrast, most verification techniques are based on more mathematically-oriented forma...
Sabina Akhtar, Stephan Merz, Martin Quinson
SIAMREV
2010
170views more  SIAMREV 2010»
15 years 23 days ago
Network Properties Revealed through Matrix Functions
The newly emerging field of Network Science deals with the tasks of modelling, comparing and summarizing large data sets that describe complex interactions. Because pairwise affin...
Ernesto Estrada, Desmond J. Higham