1964 search results - page 75 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
ICDM
2007
IEEE
14 years 2 months ago
2007
IEEE
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...
ICCSA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper, we present a parallel tabu search (TS) algorithm for efficient optimization of a constrained multiobjective VLSI standard cell placement problem. The prima...
CEE
2011
12 years 11 months ago
2011
Performance of ad hoc networks dramatically declines as network grows. Cluster formation in which the network hosts are hierarchically part...
SODA
2000
ACM
13 years 9 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
MLDM
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we describe a new cluster model which is based on the concept of linear manifolds. The method identifies subsets of the data which are embedded in arbitrary oriented...