Sciweavers

28888 search results - page 177 / 5778
» Computability and complexity in analysis
Sort
View
DSOM
2006
Springer
13 years 12 months ago
Detecting Bottleneck in n-Tier IT Applications Through Analysis
As the complexity of large-scale enterprise applications increases, providing performance verification through staging becomes an important part of reducing business risks associat...
Gueyoung Jung, Galen S. Swint, Jason Parekh, Calto...
ISIM
2007
13 years 9 months ago
Using Matrix Decompositions in Formal Concept Analysis
One of the main problems connected with the formal concept analysis and lattice construction is the high complexity of algorithms which plays a significant role when computing all ...
Václav Snásel, Petr Gajdos, Hussam M...
DAC
2010
ACM
13 years 8 months ago
Virtual channels vs. multiple physical networks: a comparative analysis
Packet-switched networks-on-chip (NoC) have been proposed as an efficient communication infrastructure for multi-core architectures. Adding virtual channels to a NoC helps to avoi...
Young-Jin Yoon, Nicola Concer, Michele Petracca, L...
EOR
2008
88views more  EOR 2008»
13 years 8 months ago
Algorithmic analysis of the Geo/Geo/c
In this paper, we consider a discrete-time queue of Geo/Geo/c type with geometric repeated attempts. It is known that its continuous counterpart, namely the M/M/c queue with expon...
Jesus R. Artalejo, Antonis Economou, Antonio G&oac...
ISSAC
2004
Springer
102views Mathematics» more  ISSAC 2004»
14 years 1 months ago
FFPACK: finite field linear algebra package
The FFLAS project has established that exact matrix multiplication over finite fields can be performed at the speed of the highly optimized numerical BLAS routines. Since many a...
Jean-Guillaume Dumas, Pascal Giorgi, Clémen...