Sciweavers

202 search results - page 17 / 41
» Counting Distance Permutations
Sort
View
DAC
2005
ACM
14 years 10 months ago
Net weighting to reduce repeater counts during placement
We demonstrate how to use placement to ameliorate the predicted repeater explosion problem caused by poor interconnect scaling. We achieve repeater count reduction by dynamically ...
Brent Goplen, Prashant Saxena, Sachin S. Sapatneka...
EVOW
2004
Springer
14 years 2 months ago
On the Structure of Sequential Search: Beyond "No Free Lunch"
In sequential, deterministic, non-redundant search the algorithm permutes a test function to obtain the search result. The mapping from test functions to search results is a one-to...
Thomas M. English
EJC
2008
13 years 9 months ago
Enumeration of almost polynomial rational functions with given critical values
1 Rational functions and minimal factorizations of permutations Let f : C C be a rational function of degree n in one complex variable. A critical point of f is a point z C such...
Dmitri Panov, Dimitri Zvonkine
COMBINATORICS
2006
121views more  COMBINATORICS 2006»
13 years 9 months ago
Asymptotics for Incidence Matrix Classes
We define incidence matrices to be zero-one matrices with no zero rows or columns. We are interested in counting incidence matrices with a given number of ones, irrespective of th...
Peter J. Cameron, Thomas Prellberg, Dudley Stark
RECOMB
2010
Springer
13 years 7 months ago
Scaffold Filling under the Breakpoint Distance
Motivated by the trend of genome sequencing without completing the sequence of the whole genomes, Mu˜noz et al. recently studied the problem of filling an incomplete multichromos...
Haitao Jiang, Chunfang Zheng, David Sankoff, Binha...