Sciweavers

147 search results - page 19 / 30
» Adaptive methods for netlist partitioning
Sort
View
CORR
2011
Springer
208views Education» more  CORR 2011»
14 years 4 months ago
GRASP and path-relinking for Coalition Structure Generation
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
82
Voted
ICCV
2003
IEEE
15 years 11 months ago
Mean Shift Based Clustering in High Dimensions: A Texture Classification Example
Feature space analysis is the main module in many computer vision tasks. The most popular technique, k-means clustering, however, has two inherent limitations: the clusters are co...
Bogdan Georgescu, Ilan Shimshoni, Peter Meer
IPM
2006
64views more  IPM 2006»
14 years 9 months ago
Text mining without document context
We consider a challenging clustering task: the clustering of muti-word terms without document co-occurrence information in order to form coherent groups of topics. For this task, ...
Eric SanJuan, Fidelia Ibekwe-Sanjuan
GECCO
2003
Springer
132views Optimization» more  GECCO 2003»
15 years 2 months ago
Circuit Bipartitioning Using Genetic Algorithm
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
Jong-Pil Kim, Byung Ro Moon
TON
2008
159views more  TON 2008»
14 years 9 months ago
Optimizing lifetime for continuous data aggregation with precision guarantees in wireless sensor networks
This paper exploits the tradeoff between data quality and energy consumption to extend the lifetime of wireless sensor networks. To obtain an aggregate form of sensor data with pre...
Xueyan Tang, Jianliang Xu