Sciweavers

6546 search results - page 64 / 1310
» Improving the Performance of the RISE Algorithm
Sort
View
ASPDAC
1999
ACM
137views Hardware» more  ASPDAC 1999»
14 years 1 months ago
A Performance-Driven I/O Pin Routing Algorithm
This paper presents a performance-driven I/O pin routing algorithm with special consideration of wire uniformity. First, a topological routing based on min-cost max-flow algorith...
Dongsheng Wang, Ping Zhang, Chung-Kuan Cheng, Arun...
AIPS
2010
13 years 11 months ago
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
Hootan Nakhost, Martin Müller 0003
EURODAC
1995
IEEE
112views VHDL» more  EURODAC 1995»
14 years 9 days ago
On implementation choices for iterative improvement partitioning algorithms
Iterative improvement partitioning algorithms such as the FM algorithm of Fiduccia and Mattheyses 8 , the algorithm of Krishnamurthy 13 , and Sanchis's extensions of these al...
Lars W. Hagen, Dennis J.-H. Huang, Andrew B. Kahng
BMCBI
2010
110views more  BMCBI 2010»
13 years 7 months ago
Improvements to previous algorithms to predict gene structure and isoform concentrations using Affymetrix Exon arrays
Background: Exon arrays provide a way to measure the expression of different isoforms of genes in an organism. Most of the procedures to deal with these arrays are focused on gene...
Miguel A. Anton, Ander Aramburu, Angel Rubio
GECCO
2003
Springer
14 years 1 months ago
A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
William A. Greene