1478 search results - page 12 / 296 » Modular Complexity Analysis via Relative Complexity |
ICONIP
2008
13 years 9 months ago
2008
In this paper we present a comparison of multiple cluster algorithms and their suitability for clustering text data. The clustering is based on similarities only, employing the Kol...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Event-driven automation of reactive functionalities for complex event processing is an urgent need in today's distributed service-oriented architectures and Web-based event-d...
AGP
1996
IEEE
13 years 11 months ago
1996
IEEE
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
SIAMMAX
2011
13 years 2 months ago
2011
We introduce a methodology for obtaining inventories of error results for families of numerical dense linear algebra algorithms. The approach for deriving the analyses is goal-orie...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...