Sciweavers

10890 search results - page 159 / 2178
» Automatic Complexity Analysis
Sort
View
JCST
2010
189views more  JCST 2010»
15 years 1 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
ICALP
2011
Springer
14 years 9 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
ICNP
2005
IEEE
16 years 2 hour ago
Typed Abstraction of Complex Network Compositions
straction of Complex Network Compositions∗ Azer Bestavros, Adam D. Bradley, Assaf J. Kfoury, and Ibrahim Matta Department of Computer Science Boston University The heterogeneity...
Azer Bestavros, Adam Bradley, Assaf J. Kfoury, Ibr...
WSC
2004
15 years 7 months ago
Traffic Flow Management Modeling and Operational Complexity
Traffic Flow Management (TFM) actions are commonly used to mitigate capacity/demand imbalances within the National Airspace System (NAS). Modeling TFM events has proven challengin...
Brendan Patrick Hogan, Leonard A. Wojcik
CORR
2010
Springer
110views Education» more  CORR 2010»
15 years 6 months ago
Detecting communities of triangles in complex networks using spectral optimization
The study of the sub-structure of complex networks is of major importance to relate topology and functionality. Many efforts have been devoted to the analysis of the modular struc...
Belkacem Serrour, Alex Arenas, Sergio Gómez