Showing 1 - 20 results of 34,015 for search '(competing OR computing) time', query time: 0.24s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5

    Fixation Time for Competing Beneficial Mutations and Their Genomic Footprint by Wolfgang Stephan

    Published 2025-06-01
    “…We present explicit formulas for the fixation time of <i>AB</i> under additive fitness of the mutants as a function of the frequency <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mrow><mi>X</mi></mrow><mrow><mn>2</mn></mrow></msub><mfenced separators="|"><mrow><mn>0</mn></mrow></mfenced><mtext> </mtext></mrow></semantics></math></inline-formula> of <i>A</i> at the time when <i>B</i> is introduced. …”
    Get full text
    Article
  6. 6
  7. 7
  8. 8

    Spike-timing-based computation in sound localization. by Dan F M Goodman, Romain Brette

    Published 2010-11-01
    “…However, beyond simple time differences, the way in which neurons might extract this information is unclear and the potential computational advantages are unknown. …”
    Get full text
    Article
  9. 9

    Resource Scheduling with Uncertain Execution Time in Cloud Computing by LI Cheng-yan, CAO Ke-han, FENG Shi-xiang, SUN Wei

    Published 2019-02-01
    “…For the problem of cloud computing resource scheduling, based on the fuzzy programming theory, a fuzzy cloud resource scheduling model under timecost constraint was set up, the uncertain execution time of tasks is represented by the triangular fuzzy number, and the target is to minimize the average value and standard deviation of the evaluation function An improved chaotic ant colony algorithm was proposed to solve the model, the elitist strategy is introduced to optimize the pheromone updating, a chaotic mapping with infinite folding times is used for chaotic search, and the adaptive chaotic disturbance mechanism is designed to enhance the global searching ability The model and algorithm were tested on the Cloudsim platform, the reliability of the model was proved, and the experimental results showed that the proposed algorithm had better performance in convergence speed, solution ability and load balance…”
    Get full text
    Article
  10. 10
  11. 11
  12. 12

    Deterministic reservoir computing for chaotic time series prediction by Johannes Viehweg, Constanze Poll, Patrick Mäder

    Published 2025-05-01
    “…Abstract Reservoir Computing was shown in recent years to be useful as efficient to learn networks in the field of time series tasks. …”
    Get full text
    Article
  13. 13
  14. 14

    Collaborate or Compete? Time-Varying Incentives versus Tolling in Parallel Bottleneck by Lin Xiao, Jiyan Wu, Xiangwang Hu, Jian Sun, Ye Tian

    Published 2023-01-01
    “…Incentive-based traffic demand management (IBTDM) schemes redistribute traffic demand across space and time. The relationship between IBTDM and traditional tolling programs impacts financial sustainability and decision making of both programs. …”
    Get full text
    Article
  15. 15

    Transition to competent oral feeding in preterm infants: Analyzing timing and determinants by Gabriela Bolea Muguruza, Cristina de Frutos Martínez, M. Teresa Tamayo Martínez, Judith Martín Corral

    Published 2025-01-01
    “…Introduction: The achievement of oral feeding competence (OFC) is a challenge in preterm infants and can be affected by several factors. …”
    Get full text
    Article
  16. 16

    Computational Ghost Imaging with Multiplexed Time-Varying Signals by Panghe Qiu, Zhiyuan Ye, Zhichen Bai, Xin Liu, Su Bo

    Published 2020-01-01
    “…This study proposes two methods of optical watermarking based on multiplexed time-varying signals for computational ghost imaging using the Hadamard matrices. …”
    Get full text
    Article
  17. 17
  18. 18

    Stochastic models for competing species with a shared pathogen by Linda J. S. Allen, Vrushali A. Bokil

    Published 2012-06-01
    “…The presence of a pathogen among multiple competing species has important ecological implications. …”
    Get full text
    Article
  19. 19
  20. 20