Sciweavers

188 search results - page 12 / 38
» When Regions Start to Move
Sort
View
DAC
1995
ACM
15 years 3 months ago
The Validity of Retiming Sequential Circuits
Retiming has been proposed as an optimizationstep forsequential circuits represented at the net-list level. Retiming moves the latches across the logic gates and in doing so chang...
Vigyan Singhal, Carl Pixley, Richard L. Rudell, Ro...
119
Voted
BMCBI
2008
116views more  BMCBI 2008»
14 years 12 months ago
Clustering exact matches of pairwise sequence alignments by weighted linear regression
Background: At intermediate stages of genome assembly projects, when a number of contigs have been generated and their validity needs to be verified, it is desirable to align thes...
Alvaro J. González, Li Liao
EOR
2008
78views more  EOR 2008»
14 years 11 months ago
Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a nonuniform amount of time tr...
Haye Lau, Shoudong Huang, Gamini Dissanayake
SAT
2004
Springer
95views Hardware» more  SAT 2004»
15 years 5 months ago
Local Search for Very Large SAT Problems
The Walksat local search algorithm has previously been extended to handle quantification over variables. This greatly reduces model sizes, but in order to guide greedy moves the a...
Steven David Prestwich, Colin Quirke
COMBINATORICS
2007
55views more  COMBINATORICS 2007»
14 years 11 months ago
Which Chessboards have a Closed Knight's Tour within the Cube?
A closed knight’s tour of a chessboard uses legal moves of the knight to visit every square exactly once and return to its starting position. When the chessboard is translated i...
Joe DeMaio