Sciweavers

594 search results - page 16 / 119
» Heuristic Measures of Interestingness
Sort
View
IPPS
2010
IEEE
13 years 6 months ago
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
Joachim Gehweiler, Henning Meyerhenke
HIPC
2005
Springer
14 years 2 months ago
Sensor Selection Heuristic in Sensor Networks
We consider the problem of sensor selection so as to minimise error in estimated location of target. An algorithm based on selecting a sensor in a direction in which the error is ...
Vaishali P. Sadaphal, Bijendra N. Jain
GECCO
2005
Springer
101views Optimization» more  GECCO 2005»
14 years 2 months ago
Measuring mobility and the performance of global search algorithms
The global search properties of heuristic search algorithms are not well understood. In this paper, we introduce a new metric, mobility, that quantifies the dispersion of local o...
Monte Lunacek, L. Darrell Whitley, James N. Knight
KDD
2006
ACM
183views Data Mining» more  KDD 2006»
14 years 9 months ago
Discovering interesting patterns through user's interactive feedback
In this paper, we study the problem of discovering interesting patterns through user's interactive feedback. We assume a set of candidate patterns (i.e., frequent patterns) h...
Dong Xin, Xuehua Shen, Qiaozhu Mei, Jiawei Han
KDD
2005
ACM
145views Data Mining» more  KDD 2005»
14 years 9 months ago
Using and Learning Semantics in Frequent Subgraph Mining
The search for frequent subgraphs is becoming increasingly important in many application areas including Web mining and bioinformatics. Any use of graph structures in mining, howev...
Bettina Berendt