Sciweavers

1964 search results - page 172 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
AIPRF
2008
13 years 9 months ago
A Coherent and Heterogeneous Approach to Clustering
Despite outstanding successes of the state-of-the-art clustering algorithms, many of them still suffer from shortcomings. Mainly, these algorithms do not capture coherency and homo...
Arian Maleki, Nima Asgharbeygi
BPM
2007
Springer
130views Business» more  BPM 2007»
14 years 2 months ago
Process Mining Based on Clustering: A Quest for Precision
Process mining techniques attempt to extract non-trivial and useful information from event logs recorded by information systems. For example, there are many process mining techniqu...
Ana Karla Alves de Medeiros, Antonella Guzzo, Gian...
RTCSA
2000
IEEE
13 years 11 months ago
Space efficient wait-free buffer sharing in multiprocessor real-time systems based on timing information
A space efficient wait-free algorithm for implementing a shared buffer for real-time multiprocessor systems is presented in this paper. The commonly used method to implement share...
Håkan Sundell, Philippas Tsigas
FASE
2010
Springer
14 years 2 months ago
Why the Virtual Nature of Software Makes It Ideal for Search Based Optimization
This paper1 provides a motivation for the application of search based optimization to Software Engineering, an area that has come to be known as Search Based Software Engineering (...
Mark Harman
SDM
2009
SIAM
176views Data Mining» more  SDM 2009»
14 years 5 months ago
Constraint-Based Subspace Clustering.
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
Élisa Fromont, Adriana Prado, Céline...