25 search results - page 3 / 5 » On uniquely k-determined permutations |
IFIP
2004
Springer
15 years 5 months ago
2004
Springer
In the STS-based mapping, we are requested to obtain the correct order of probes in a DNA sequence from a given set of fragments or equivalently a hybridization matrix A. It is wel...
128
click to vote
ECML
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This paper presents an empirical study of population diversity measure and adaptive control of diversity in the context of a permutation-based algorithm for Traveling Sal...
JPDC
2000
14 years 11 months ago
2000
In this paper, we study optical multistage interconnection networks (MINs). Advances in electro-optic technologies have made optical communication a promising networking choice to...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
This paper presents the following results on sets that are complete for NP. (i) If there is a problem in NP that requires 2nΩ(1) time at almost all lengths, then every many-one N...
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...