Sciweavers

2313 search results - page 162 / 463
» On Heuristic Time Hierarchies
Sort
View
DAC
1997
ACM
15 years 10 months ago
Multilevel Circuit Partitioning
Recent work [2] [5] [11] [12] [14] has illustrated the promise of multilevel approaches for partitioning large circuits. Multilevel partitioning recursively clusters the instance ...
Charles J. Alpert, Jen-Hsin Huang, Andrew B. Kahng
BIBM
2009
IEEE
118views Bioinformatics» more  BIBM 2009»
15 years 10 months ago
Inexact Local Alignment Search over Suffix Arrays
We describe an algorithm for finding approximate seeds for DNA homology searches. In contrast to previous algorithms that use exact or spaced seeds, our approximate seeds may conta...
Mohammadreza Ghodsi, Mihai Pop
DATE
2004
IEEE
89views Hardware» more  DATE 2004»
15 years 10 months ago
Improved Symoblic Simulation by Dynamic Funtional Space Partitioning
In this paper, we provide a flexible and automatic method to partition the functional space for efficient symbolic simulation. We utilize a 2-tuple list representation as the basi...
Tao Feng, Li-C. Wang, Kwang-Ting Cheng, Chih-Chan ...
ECML
2006
Springer
15 years 10 months ago
An Efficient Approximation to Lookahead in Relational Learners
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
Jan Struyf, Jesse Davis, C. David Page Jr.
GECCO
2000
Springer
225views Optimization» more  GECCO 2000»
15 years 10 months ago
Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
Kengo Katayama, Masafumi Tani, Hiroyuki Narihisa