2007. Robust refinement of initial prototypes for partitioning-based clustering algorithms. In: Skiadas, C. H. (Ed.) Recent Advances in Stochastic Modeling and Data Analysis. World Scientific. Pp. 473-482.Robust refinement of initial prototypes for partitioning-based clustering algorithms - Äy...
Partitioning based algorithms for some colouring problems - Angelsmark, Thapper - 2005Angelsmark, O., Thapper, J.: Partitioning based algorithms for some colouring problems. In Hnich, B., Carlsson, M., Fages, F., Rossi, F., eds.: CSCLP. Volume 3978 of Lecture Notes in Computer ...
relates the cut computed by partitionerpfor instanceito the smallest minimum cut ofallalgorithms, i.e., . Theperformance profile of algorithmpis then given by the function . For connectivity optimization, the performance ratios are computed using the connectivity values ...
Most graph partitioning algorithms subdivide the vertex set into partitions of similar size, trying to keep the ndoi:10.1007/978-3-662-48096-0_27Alessio GuerrieriAlberto MontresorSpringer Berlin HeidelbergEuropean Conference on Parallel Processing
Abstract:Whendealingwiththecontinuousspaceproblems,thetraditionalQ-iterationalgorithmsbasedonlookup-table orfunctionapproximationconvergeslowlyandaredifficulttogetacontinuouspolicy.Toovercometheaboveweak- nesses,anon-policyTDalgorithmnamedDFP-OPTDwasproposedbasedondouble-layerfuzzypartitioningandits convergencewasproved.Th...
We use the performance plots introduced inALENEX'16to compare KaHyPar to other partitioning algorithms in terms of solution quality: For each algorithm, these plots relate the smallest minimum connectivity of all algorithms to the corresponding connectivity produced by the algorithm on a per-instance ...
NP-hard problem is generally solved by fast heuristic algorithms. The well known Kernighan–Lin (KL) [10] algorithm, has proposed a heuristic procedure for two-way (k = 2) graph partitioning algorithm. It partitions the access network domain in two non-overlapping partitions. Several authors ...
Comparative Analysis of Decision Tree Algorithms for Data Warehouse Fragmentation 2021, Studies in Computational Intelligence Exploiting Sharing Join Opportunities in Big Data Multiquery Optimization with Flink 2020, Complexity View all citing articles on ScopusView...
A new task model: built heterogeneous multi-processors multi-frame task model and solution in genetic algorithms. Result shows that new model is more generalized, achieves larger succeed partitioning percent; the algorithms have lower time-complexity and reliable result....
Recent multi-robot exploration algorithms usually rely on occupancy grids as their core world representation. However, those grids are not appropriate for environments that are very large or whose boundaries are not well delimited from the beginning of the exploration. In contrast, polygonal ...