147 search results - page 5 / 30 » Adaptive methods for netlist partitioning |
175
Voted
ANTSW
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In this work, we propose a method for self-organized adaptive task partitioning in a swarm of robots. Task partitioning refers to the decomposition of a task into less co...
134
Voted
ICCAD
2004
IEEE
16 years 15 days ago
2004
IEEE
—In this paper, we present a new block budgeting algorithm which speeds up timing closure in timing driven hierarchical flows. After a brief description of the addressed flow, ...
139
Voted
PPSC
1997
15 years 5 months ago
1997
A parallel method for dynamic partitioning of unstructured meshes is described. The method employs a new iterative optimisation technique which both balances the workload and atte...
143
Voted
FUZZIEEE
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, we present a local, adaptive optimization scheme for adjusting the number of clusters in fuzzy C-means clustering. This method is especially motivated by online app...
121
Voted
ADC
2003
Springer
15 years 8 months ago
2003
Springer
Minkowski-sum cost model indicates that balanced data partitioning is not beneficial for high dimensional data. Thus we study several unbalanced partitioning methods and propose ...