3894 search results - page 752 / 779 » Approximation Algorithms for Biclustering Problems |
TAMC
2009
Springer
13 years 11 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
HPDC
2000
IEEE
13 years 11 months ago
2000
IEEE
In this paper, we present a performance evaluation of a wide-area cluster system based on a rewallenabled Globus metacomputing toolkit. In order to establish communication links ...
ASPDAC
2001
ACM
13 years 10 months ago
2001
ACM
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...
KDD
2000
ACM
13 years 10 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
GECCO
2008
Springer
13 years 7 months ago
2008
Springer
While John Holland has always envisioned learning classifier systems (LCSs) as cognitive systems, most work on LCSs has focused on classification, datamining, and function appro...