693 search results - page 69 / 139 » Complexity Analysis of Heuristic CSP Search Algorithms |
WABI
2005
Springer
14 years 1 months ago
2005
Springer
d Abstract] Tamir Tuller , Efrat Oron , Erez Makavy , Daniel A. Chamovitz † , and Benny Chor ‡ Tel-Aviv University, Tel-Aviv 69978, Israel. Abstract. We study gene expression d...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
Aligning multiple DNA or protein sequences is a fundamental step in the analyses of phylogeny, homology and molecular structure. Heuristic algorithms are applied because optimal mu...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Histogram construction or sequence segmentation is a basic task with applications in database systems, information retrieval, and knowledge management. Its aim is to approximate a...
STOC
1989
ACM
14 years 2 days ago
1989
ACM
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...