Sciweavers

218 search results - page 13 / 44
» Convexity-based algorithms for design centering
Sort
View
GEM
2007
13 years 9 months ago
Initial Population for Genetic Algorithms: A Metric Approach
- Besides the difficulty of the application problem to be solved with Genetic Algorithms (GAs), an additional difficulty arises because the quality of the solution found, or the ...
Pedro A. Diaz-Gomez, Dean F. Hougen
METMBS
2004
162views Mathematics» more  METMBS 2004»
13 years 9 months ago
A Comparison of DNA Fragment Assembly Algorithms
As more research centers embark on sequencing new genomes, the problem of DNA fragment assembly for shotgun sequencing is growing in importance and complexity. Accurate and fast a...
Lishan Li, Sami Khuri
ISPD
2006
ACM
108views Hardware» more  ISPD 2006»
14 years 1 months ago
Statistical clock tree routing for robustness to process variations
Advances in VLSI technology make clock skew more susceptible to process variations. Notwithstanding efficient zero skew routing algorithms, clock skew still limits post-manufactu...
Uday Padmanabhan, Janet Meiling Wang, Jiang Hu
ICPR
2008
IEEE
14 years 2 months ago
A novel validity measure for clusters of arbitrary shapes and densities
Several validity indices have been designed to evaluate solutions obtained by clustering algorithms. Traditional indices are generally designed to evaluate center-based clustering...
Noha A. Yousri, Mohamed S. Kamel, Mohamed A. Ismai...
CHI
2007
ACM
14 years 8 months ago
Work-centered design: a case study of a mixed-initiative scheduler
We present the case study of a complex, mixed-initiative scheduling system to illustrate Work-Centered Design (WCD), a new approach for the design of information systems. WCD is b...
Keith A. Butler, Jiajie Zhang, Chris Esposito, Ali...