Suchergebnisse - "random algorithm"

  • Treffer 1 - 13 von 13
Treffer weiter einschränken
  1. 1

    Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints von Stolyar, Alexander L., Zhong, Yuan

    ISSN: 0257-0130, 1572-9443
    Veröffentlicht: Boston Springer US 01.02.2015
    Veröffentlicht in Queueing systems (01.02.2015)
    “… There is an infinite number of servers. Multiple customers can be placed for service into one server, subject to general “packing” constraints …”
    Volltext
    Journal Article
  2. 2

    Weight-based Double Random Sampling Method with Multiple Constraints von Jia, Hong

    Veröffentlicht: IEEE 03.03.2023
    “… However, the traditional research of double random algorithm mainly focuses on randomly selecting a single market subject and supervisor, while ignoring the constraints in the actual inspection process …”
    Volltext
    Tagungsbericht
  3. 3

    Inventory control with flexible demand: Cyclic case with multiple batch supply and demand processes von Petering, Matthew E.H., Chen, Xi, Hsieh, Wen-Huan

    ISSN: 0925-5273, 1873-7579
    Veröffentlicht: Elsevier B.V 01.06.2019
    Veröffentlicht in International journal of production economics (01.06.2019)
    “… by multiple batch supply processes and consumed by multiple batch demand processes. The problem is noteworthy in that the decision maker has control over the timing and lot sizes of all supply and demand processes subject to (1 …”
    Volltext
    Journal Article
  4. 4

    On the rate of convergence of one inhomogeneous Markov algorithm of search for extremum von Tikhomirov, A. S.

    ISSN: 1063-4541, 1934-7855
    Veröffentlicht: Heidelberg Allerton Press, Inc 01.12.2011
    Veröffentlicht in Vestnik, St. Petersburg University. Mathematics (01.12.2011)
    “… The paper is concerned with theoretical study of the rate of convergence of one inhomogeneous Markov random algorithm of search for extremum …”
    Volltext
    Journal Article
  5. 5

    AoI-based Joint User Scheduling and Transmit Power Optimization in High-speed Railway Mobile Networks von Zhang, Xiang, Luan, Ning, Lu, Yuping, Zhang, Zhifei, Dong, Rui, Xiong, Ke

    Veröffentlicht: IEEE 03.10.2022
    “… ) manner to fulfill the uplink transmissions. In order to minimize the average achievable AoI of the sensors, we formulate an optimization problem subject to the constraints of the minimal amount of data required to be uploaded by passengers …”
    Volltext
    Tagungsbericht
  6. 6

    THE USE OF TIKTOK APPLICATION IN LEARNING ENGLISH SPEAKING: STUDENTS’ PERCEPTION von Humairah, Andi Ananda, Mahmud, Murni, Amin, Fatimah Hidayahni

    ISSN: 2656-9914, 2656-8772
    Veröffentlicht: 05.04.2025
    “… The research subjects have been selected purposively with 6 students regarding their experiences learning English speaking using TikTok application …”
    Volltext
    Journal Article
  7. 7

    Heart rate differences between targets and non targets in intuition tasks von Tressoldi, P E, Martinelli, M, Massaccesi, S, Sartori, L

    ISSN: 0131-1646
    Veröffentlicht: Russia (Federation) 01.11.2005
    Veröffentlicht in Fiziologiia cheloveka (01.11.2005)
    “… Each subject performed 20 trials. In each trial the target was automatically selected using a pseudo-random algorithm …”
    Weitere Angaben
    Journal Article
  8. 8

    Uncertainty-Aware Test Prioritization: Approaches and Empirical Evaluation von Zhang, Man, Wu, Jiahui, Ali, Shaukat, Yue, Tao

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 21.11.2023
    Veröffentlicht in arXiv.org (21.11.2023)
    “… Complex software systems, e.g., Cyber-Physical Systems (CPSs), interact with the real world; thus, they often behave unexpectedly in uncertain environments …”
    Volltext
    Paper
  9. 9

    First-passage time statistics for non-linear diffusion von Chelminiak, Przemyslaw

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 22.11.2022
    Veröffentlicht in arXiv.org (22.11.2022)
    “… Evaluating the completion time of a random algorithm or a running stochastic process is a valuable tip not only from a purely theoretical, but also pragmatic point of view …”
    Volltext
    Paper
  10. 10

    COVERT PSI IN COMPUTER SOLITAIRE von PALMER, JOHN

    ISSN: 0022-3387
    Veröffentlicht: Durham, N.C Parapsychology Press 01.06.2000
    Veröffentlicht in The Journal of parapsychology (01.06.2000)
    “… Palmer reports two series in which subjects could use psi to continue playing computer solitaire and possibly win a prize …”
    Volltext
    Journal Article
  11. 11

    Explore Electrotactile Parametric Properties Using an Electrical Stimulation System von Zhou, Ziliang, Yang, Yicheng, Zeng, Jia, Wang, Xiaoxin, Liu, Honghai

    ISSN: 1530-437X, 1558-1748
    Veröffentlicht: New York IEEE 01.04.2022
    Veröffentlicht in IEEE sensors journal (01.04.2022)
    “… ) with interactive algorithms have been designed. Modified staircase method, bisection and parametric-random algorithms are developed for the psychophysical measurement of detection thresholds (DT), pain threshold (PT …”
    Volltext
    Journal Article
  12. 12

    Optimum Power Selection Algorithms in Aloha Networks: Random and Deterministic Approaches von Khoshnevis, B., Khalaj, B.H.

    ISSN: 1536-1276, 1558-2248
    Veröffentlicht: Piscataway, NJ IEEE 01.08.2007
    Veröffentlicht in IEEE transactions on wireless communications (01.08.2007)
    “… In this paper, we discuss the optimum random and deterministic power selection algorithms in Aloha networks, where nodes run Exponential Backoff (EB) for …”
    Volltext
    Journal Article
  13. 13

    Joint MCS Adaptation and RB Allocation in Cellular Networks Based on Deep Reinforcement Learning With Stable Matching von Ye, Xiaowen, Fu, Liqun

    ISSN: 1536-1233, 1558-0660
    Veröffentlicht: Los Alamitos IEEE 01.01.2024
    Veröffentlicht in IEEE transactions on mobile computing (01.01.2024)
    “… ) under limited available RBs. We aim to minimize the total RB consumption subject to the rigorous constraints of each UE's QoS requirement …”
    Volltext
    Magazine Article