Sciweavers

1096 search results - page 152 / 220
» Evaluating Algorithms for Concept Description
Sort
View
ICSM
2009
IEEE
13 years 6 months ago
Decomposing object-oriented class modules using an agglomerative clustering technique
Software can be considered a live entity, as it undergoes many alterations throughout its lifecycle. Furthermore, developers do not usually retain a good design in favor of adding...
Marios Fokaefs, Nikolaos Tsantalis, Alexander Chat...
ICALP
2009
Springer
14 years 9 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
KDD
2009
ACM
160views Data Mining» more  KDD 2009»
14 years 3 months ago
Clustering event logs using iterative partitioning
The importance of event logs, as a source of information in systems and network management cannot be overemphasized. With the ever increasing size and complexity of today’s even...
Adetokunbo Makanju, A. Nur Zincir-Heywood, Evangel...
ICFCA
2009
Springer
14 years 3 months ago
Factor Analysis of Incidence Data via Novel Decomposition of Matrices
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
Radim Belohlávek, Vilém Vychodil
CEC
2009
IEEE
14 years 3 months ago
Particle Swarm CMA Evolution Strategy for the optimization of multi-funnel landscapes
— We extend the Evolution Strategy with Covariance Matrix Adaptation (CMA-ES) by collaborative concepts from Particle Swarm Optimization (PSO). The proposed Particle Swarm CMA-ES...
Christian L. Müller, Benedikt Baumgartner, Iv...