نتایج جستجو برای: crossing

تعداد نتایج: 27684  

A. Kaveh , M. Ilchi Ghazaan,

This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...

Journal: :Genetics 1989
N L Kaplan R R Hudson C H Langley

The number of selectively neutral polymorphic sites in a random sample of genes can be affected by ancestral selectively favored substitutions at linked loci. The degree to which this happens depends on when in the history of the sample the selected substitutions happen, the strength of selection and the amount of crossing over between the sampled locus and the loci at which the selected substi...

Journal: :IEEE Trans. Acoustics, Speech, and Signal Processing 1987
Susan R. Curtis Shlomo Shamai Alan V. Oppenheim

In this correspondence, we present new results on the reconstruction of two-dimensional signals from zero crossing or threshold crossing information. Specifically, we develop new theoretical results which state conditions under which two-dimensional bandlimited signals are uniquely specified to within a scale factor with this information. Unlike previous results in this area, our new results do...

2005
Ron Doney Ross Maller

Let Rn = max0≤j≤n Sj − Sn be a random walk Sn reflected in its maximum. We give necessary and sufficient conditions for finiteness of passage times of Rn above horizontal or certain curved (power law) boundaries. Necessary and sufficient conditions are also given for the finiteness of the expected passage time of Rn above linear and square root boundaries. 2000 MSC Subject Classifications: prim...

Journal: :Journal of Interconnection Networks 2003
Robert J. Cimikowski Imrich Vrto

Improved bounds for the crossing number of the mesh of trees graph, Mn, are derived. In particular, we derive a new lower bound of 5n log n−44n 80 ‡ which improves on the previous bound of Leighton [11] by a constant factor, and an upper bound of (log n− 10 3 )n 2 + 8n− 20 3 . In addition, we construct drawings of Mn which achieve the upper bound number of crossings. We also prove that the cros...

2003
Farhad Shahrokhi Ondrej Sýkora László A. Székely Imrich Vrto

Journal: :Proceedings of the National Academy of Sciences of the United States of America 2000
R K Colwell

During my residence in the Amazon district I took every opportunity of determining the limits of species, and I soon found that the Amazon, the Rio Negro and the Madeira formed the limits beyond which certain species never passed. The native hunters are perfectly acquainted with this fact, and always cross over the river when they want to procure particular animals, which are found even on the ...

Journal: :Genetical research 1998
M Slatkin T Wiehe

The problem of genetic hitch-hiking in a geographically subdivided population is analysed under the assumption that migration rates among populations are relatively small compared with the selection coefficient for a newly arising advantageous allele. The approximate method used in the paper is valid when the number of emigrants per generation (Nm) is less than one. The approximate analysis sho...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید