Sciweavers

17760 search results - page 415 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
GECCO
2007
Springer
184views Optimization» more  GECCO 2007»
15 years 11 months ago
Multi-objective optimization tool for a free structure analog circuits design using genetic algorithms and incorporating parasit
This paper presents a novel approach for a free structure analog circuit design using Genetic Algorithms (GA). A major problem in a free structure circuit is its sensitivity calcu...
Yaser M. A. Khalifa, Badar K. Khan, Faisal Taha
ESOP
2009
Springer
15 years 11 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
GLVLSI
2009
IEEE
172views VLSI» more  GLVLSI 2009»
15 years 11 months ago
Contact merging algorithm for efficient substrate noise analysis in large scale circuits
A methodology is proposed to efficiently estimate the substrate noise generated by large scale aggressor circuits. Small spatial voltage differences within the ground distribution...
Emre Salman, Renatas Jakushokas, Eby G. Friedman, ...
CPM
2004
Springer
86views Combinatorics» more  CPM 2004»
15 years 11 months ago
Two Algorithms for LCS Consecutive Suffix Alignment
The problem of comparing two sequences A and B to determine their similarity is one of the fundamental problems in pattern matching. A challenging, basic variation of the sequence...
Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson
GECCO
2006
Springer
265views Optimization» more  GECCO 2006»
15 years 11 months ago
Cutting stock waste reduction using genetic algorithms
A new model for the One-dimensional Cutting Stock problem using Genetic Algorithms (GA) is developed to optimize construction steel bars waste. One-dimensional construction stocks...
Yaser M. A. Khalifa, O. Salem, A. Shahin