850 search results - page 65 / 170 » heuristics 2006 |
APWEB
2006
Springer
14 years 2 months ago
2006
Springer
We give a new view on building content clusters from page pair models. We measure the heuristic importance within every two pages by computing the distance of their accessed positi...
CEAS
2006
Springer
14 years 2 months ago
2006
Springer
Email thread reassembly is the task of linking messages by parentchild relationships. In this paper, we present two approaches to address this problem. One exploits previously und...
DAGM
2006
Springer
14 years 2 months ago
2006
Springer
Existing methods for segmentation by edgel linking are based on heuristics and give no guarantee for a topologically correct result. In this paper, we propose an edgel linking algo...
EVOW
2006
Springer
14 years 2 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
GECCO
2006
Springer
14 years 2 months ago
2006
Springer
This study aims to design a new co-evolution algorithm, Mixture Co-evolution which enables modeling of integration and composition of direct co-evolution and indirect coevolution....