Sciweavers

4110 search results - page 78 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
CATS
2006
15 years 5 months ago
On the Approximability of Maximum and Minimum Edge Clique Partition Problems
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...
124
Voted
CPM
2006
Springer
143views Combinatorics» more  CPM 2006»
15 years 7 months ago
Algorithms for Finding a Most Similar Subforest
Given an ordered labeled forest F ("the target forest") and an ordered labeled forest G ("the pattern forest"), the most similar subforest problem is to find a ...
Jesper Jansson, Zeshan Peng
133
Voted
JUCS
2006
112views more  JUCS 2006»
15 years 3 months ago
A Multi-objective Genetic Approach to Mapping Problem on Network-on-Chip
Abstract: Advances in technology now make it possible to integrate hundreds of cores (e.g. general or special purpose processors, embedded memories, application specific components...
Giuseppe Ascia, Vincenzo Catania, Maurizio Palesi
DFT
2009
IEEE
210views VLSI» more  DFT 2009»
15 years 7 months ago
Optimizing Parametric BIST Using Bio-inspired Computing Algorithms
Optimizing the BIST configuration based on the characteristics of the design under test is a complicated and challenging work for test engineers. Since this problem has multiple o...
Nastaran Nemati, Amirhossein Simjour, Amirali Ghof...
EC
2010
176views ECommerce» more  EC 2010»
15 years 1 months ago
Learning Factorizations in Estimation of Distribution Algorithms Using Affinity Propagation
Estimation of distribution algorithms (EDAs) that use marginal product model factorizations have been widely applied to a broad range of, mainly binary, optimization problems. In ...
Roberto Santana, Pedro Larrañaga, Jos&eacut...