Sciweavers

8016 search results - page 1232 / 1604
» On the practical genetic algorithms
Sort
View
GLVLSI
2003
IEEE
153views VLSI» more  GLVLSI 2003»
16 years 18 hour ago
FORCE: a fast and easy-to-implement variable-ordering heuristic
The MINCE heuristic for variable-ordering [1] successfully reduces the size of BDDs and can accelerate SAT-solving. Applications to reachability analysis have also been successful...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
ICCAD
2003
IEEE
129views Hardware» more  ICCAD 2003»
16 years 15 hour ago
Performance Optimization of Latency Insensitive Systems Through Buffer Queue Sizing of Communication Channels
This paper proposes for latency insensitive systems a performance optimization technique called channel buffer queue sizing, which is performed after relay station insertion in th...
Ruibing Lu, Cheng-Kok Koh
ICDM
2003
IEEE
141views Data Mining» more  ICDM 2003»
16 years 14 hour ago
TSP: Mining Top-K Closed Sequential Patterns
Sequential pattern mining has been studied extensively in data mining community. Most previous studies require the specification of a minimum support threshold to perform the min...
Petre Tzvetkov, Xifeng Yan, Jiawei Han
ISVLSI
2003
IEEE
97views VLSI» more  ISVLSI 2003»
16 years 4 hour ago
Q-Tree: A New Iterative Improvement Approach for Buffered Interconnect Optimization
The “chicken-egg” dilemma between VLSI interconnect timing optimization and delay calculation suggests an iterative approach. We separate interconnect timing transformation as...
Andrew B. Kahng, Bao Liu
ADC
2003
Springer
118views Database» more  ADC 2003»
15 years 12 months ago
CrystalBall : A Framework for Mining Variants of Association Rules
The mining of informative rules calls for methods that include different attributes (e.g., weights, quantities, multipleconcepts) suitable for the context of the problem to be an...
Kok-Leong Ong, Wee Keong Ng, Ee-Peng Lim
« Prev « First page 1232 / 1604 Last » Next »