Sciweavers

280 search results - page 25 / 56
» New Algorithms for Enumerating All Maximal Cliques
Sort
View
ASPDAC
2010
ACM
637views Hardware» more  ASPDAC 2010»
14 years 9 months ago
A new graph-theoretic, multi-objective layout decomposition framework for double patterning lithography
As Double Patterning Lithography(DPL) becomes the leading candidate for sub-30nm lithography process, we need a fast and lithography friendly decomposition framework. In this pape...
Jae-Seok Yang, Katrina Lu, Minsik Cho, Kun Yuan, D...
SIGMOD
2004
ACM
196views Database» more  SIGMOD 2004»
15 years 12 months ago
FARMER: Finding Interesting Rule Groups in Microarray Datasets
Microarray datasets typically contain large number of columns but small number of rows. Association rules have been proved to be useful in analyzing such datasets. However, most e...
Gao Cong, Anthony K. H. Tung, Xin Xu, Feng Pan, Ji...
FM
2009
Springer
157views Formal Methods» more  FM 2009»
15 years 6 months ago
Symbolic Predictive Analysis for Concurrent Programs
Abstract. Predictive analysis aims at detecting concurrency errors during runtime by monitoring a concrete execution trace of a concurrent program. In recent years, various models ...
Chao Wang, Sudipta Kundu, Malay K. Ganai, Aarti Gu...
SPDP
1991
IEEE
15 years 3 months ago
Asynchronous parallel search by the parallel genetic algorithm
The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete proble...
Heinz Mühlenbein
EOR
2007
95views more  EOR 2007»
14 years 11 months ago
A hybrid genetic algorithm for the two-dimensional single large object placement problem
In the two-dimensional single large object placement problem, we are given a rectangular master surface which has to be cut into a set of smaller rectangular items, with the aim o...
Eleni Hadjiconstantinou, Manuel Iori