Suchergebnisse - "randomized algorithms"

  1. 1

    A Hitchhiker's guide to statistical tests for assessing randomized algorithms in software engineering von Arcuri, Andrea, Briand, Lionel

    ISSN: 0960-0833, 1099-1689
    Veröffentlicht: Chichester Blackwell Publishing Ltd 01.05.2014
    Veröffentlicht in Software testing, verification & reliability (01.05.2014)
    “… However, randomized algorithms are affected by chance and so require the use of appropriate statistical tests to be properly analysed in a sound manner …”
    Volltext
    Journal Article
  2. 2

    Randomized Algorithms for Scheduling Multi-Resource Jobs in the Cloud von Psychas, Konstantinos, Ghaderi, Javad

    ISSN: 1063-6692, 1558-2566
    Veröffentlicht: New York IEEE 01.10.2018
    Veröffentlicht in IEEE/ACM transactions on networking (01.10.2018)
    “… it. The scheduling of jobs is subject to two constraints: 1) packing constraints : multiple jobs can be served simultaneously by a single server if their cumulative resource requirement does not exceed the capacity of the server, and 2) non-preemption …”
    Volltext
    Journal Article
  3. 3

    Subspace-orbit randomized algorithms for low rank approximations of third-order tensors in t-product format von Wang, Xuezhong, Wang, Kai, Mo, Changxin

    ISSN: 0031-3203
    Veröffentlicht: Elsevier Ltd 01.02.2026
    Veröffentlicht in Pattern recognition (01.02.2026)
    “… Given a truncated term K, we derive randomized algorithms for approximating the K-term t-SVD, which is called as the subspace-orbit randomized t-SVD (sort-SVD …”
    Volltext
    Journal Article
  4. 4

    Sequential Randomized Algorithms for Robust Convex Optimization von Wada, Takayuki, Fujisaki, Yasumasa

    ISSN: 0018-9286, 1558-2523
    Veröffentlicht: New York IEEE 01.12.2015
    Veröffentlicht in IEEE transactions on automatic control (01.12.2015)
    “… Sequential randomized algorithms are considered for robust convex optimization which minimizes a linear objective function subject to a parameter dependent convex constraint …”
    Volltext
    Journal Article
  5. 5

    Randomized algorithms for probabilistic analysis of parametric uncertainties with unmanned helicopters von Singh, Rupam, Bhushan, Bharat

    ISSN: 0888-3270, 1096-1216
    Veröffentlicht: Berlin Elsevier Ltd 01.05.2021
    Veröffentlicht in Mechanical systems and signal processing (01.05.2021)
    “… •Optimized design parameters to achieve tradeoff between stability and performance. This paper aims at the development of a randomized algorithm based probabilistic analysis approach for parametric uncertainties in unmanned helicopter systems …”
    Volltext
    Journal Article
  6. 6

    Randomized Algorithms for Distributed Nonlinear Optimization Under Sparsity Constraints von Ravazzi, Chiara, Fosson, Sophie M., Magli, Enrico

    ISSN: 1053-587X, 1941-0476
    Veröffentlicht: New York IEEE 15.03.2016
    Veröffentlicht in IEEE transactions on signal processing (15.03.2016)
    “… In this paper, we consider the in-network minimization of a continuously differentiable nonlinear function which is a combination of local agent objective functions subject to sparsity constraints on the variables …”
    Volltext
    Journal Article
  7. 7

    Randomized algorithms for scheduling VMs in the cloud von Ghaderi, Javad

    Veröffentlicht: IEEE 01.04.2016
    “… it. The scheduling of VMs is subject to: (i) packing constraints, i.e., multiple VMs can be be served simultaneously by a single server if their cumulative resource requirement does not violate the capacity of the server, and (ii) non-preemption, i.e …”
    Volltext
    Tagungsbericht
  8. 8

    An approach for applying Test-Driven Development (TDD) in the development of randomized algorithms von Ivo, André A. S., Guerra, Eduardo M., Porto, Sandy M., Choma, Joelma, Quiles, Marcos G.

    ISSN: 2195-1721, 2195-1721
    Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 18.09.2018
    “… However, the application of TDD with randomized algorithms have been a challenge, especially when the execution demands several random choices …”
    Volltext
    Journal Article
  9. 9

    Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes von Chekuri, Chandra, Vondrák, Jan, Zenklusen, Rico

    ISSN: 0097-5397, 1095-7111
    Veröffentlicht: 01.01.2014
    Veröffentlicht in SIAM journal on computing (01.01.2014)
    “… We consider the problem of maximizing a nonnegative submodular set function $f:2 perpendicular \rightarrow {\mathbb R}_+$ over a ground set $N$ subject to a variety of packing-type constraints including …”
    Volltext
    Journal Article
  10. 10

    Randomized algorithms for motif detection von Wang, Lusheng, Dong, Liang

    ISSN: 0219-7200
    Veröffentlicht: Singapore 01.10.2005
    Veröffentlicht in Journal of bioinformatics and computational biology (01.10.2005)
    “… locating binding sites regulatory signals, designing genetic probes etc. In this paper, we propose a randomized algorithm, design an improved EM algorithm and combine them to form a software tool. (1 …”
    Weitere Angaben
    Journal Article
  11. 11

    Randomized approximation algorithms for monotone k-submodular function maximization with constraints von Li, Yuying, Li, Min, Zhou, Yang, Niu, Shuxian, Liu, Qian

    ISSN: 1382-6905, 1573-2886
    Veröffentlicht: New York Springer US 01.05.2025
    Veröffentlicht in Journal of combinatorial optimization (01.05.2025)
    “… or detection efficiency. This paper first proposes two randomized algorithms aimed at improving the approximation ratio for maximizing monotone k -submodular functions under matroid constraints and individual size constraints …”
    Volltext
    Journal Article
  12. 12

    The scenario approach to robust control design von Calafiore, G.C., Campi, M.C.

    ISSN: 0018-9286, 1558-2523
    Veröffentlicht: New York, NY IEEE 01.05.2006
    Veröffentlicht in IEEE transactions on automatic control (01.05.2006)
    “… This paper proposes a new probabilistic solution framework for robust control analysis and synthesis problems that can be expressed in the form of minimization of a linear objective subject to convex …”
    Volltext
    Journal Article
  13. 13

    Random Convex Programs von Calafiore, Giuseppe Carlo

    ISSN: 1052-6234, 1095-7189
    Veröffentlicht: Philadelphia Society for Industrial and Applied Mathematics 01.01.2010
    Veröffentlicht in SIAM journal on optimization (01.01.2010)
    “… Random convex programs (RCPs) are convex optimization problems subject to a finite number N of random constraints …”
    Volltext
    Journal Article
  14. 14

    A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints von Necoara, Ion, Patrascu, Andrei

    ISSN: 0926-6003, 1573-2894
    Veröffentlicht: Boston Springer US 01.03.2014
    Veröffentlicht in Computational optimization and applications (01.03.2014)
    “… In this paper we propose a variant of the random coordinate descent method for solving linearly constrained convex optimization problems with composite …”
    Volltext
    Journal Article
  15. 15

    What Do Randomized Studies of Housing Mobility Demonstrate?: Causal Inference in the Face of Interference von Sobel, Michael E

    ISSN: 0162-1459, 1537-274X
    Veröffentlicht: Alexandria, VA Taylor & Francis 01.12.2006
    Veröffentlicht in Journal of the American Statistical Association (01.12.2006)
    “… ; that is, a subject's value on the response depends only on the treatment to which that subject is assigned, not on the treatment assignments of other subjects …”
    Volltext
    Journal Article
  16. 16

    Distributed robust time-efficient broadcasting algorithms for multi-channel wireless multi-hop networks with channel disruption von Tian, Xiang, Zhang, Baoxian, Mouftah, Hussein

    ISSN: 0140-3664, 1873-703X
    Veröffentlicht: Elsevier B.V 15.02.2020
    Veröffentlicht in Computer communications (15.02.2020)
    “… ) multi-channel wireless multihop networks subject to channel disruption. In this study, we make the following assumptions …”
    Volltext
    Journal Article
  17. 17

    Bounding duality gap for separable problems with linear constraints von Udell, Madeleine, Boyd, Stephen

    ISSN: 0926-6003, 1573-2894
    Veröffentlicht: New York Springer US 01.06.2016
    Veröffentlicht in Computational optimization and applications (01.06.2016)
    “… We propose a randomized algorithm to solve the convexified problem which finds an ϵ -suboptimal solution to the original problem …”
    Volltext
    Journal Article
  18. 18

    Sex: The power of randomization von Vasylenko, Liudmyla, Feldman, Marcus W., Papadimitriou, Christos, Livnat, Adi

    ISSN: 0040-5809, 1096-0325, 1096-0325
    Veröffentlicht: United States Elsevier Inc 01.10.2019
    Veröffentlicht in Theoretical population biology (01.10.2019)
    “… ) by random sampling or random assignment to conditions. Combined with various forms of evaluation, this breaking of pattern becomes an extraordinarily powerful tool, as also seen in many randomized algorithms in computer …”
    Volltext
    Journal Article
  19. 19

    A Power-of-Two Choices Based Algorithm for Fog Computing von Beraldi, Roberto, Alnuweiri, Hussein, Mtibaa, Abderrahmen

    ISSN: 2168-7161, 2372-0018
    Veröffentlicht: Piscataway IEEE Computer Society 01.07.2020
    Veröffentlicht in IEEE transactions on cloud computing (01.07.2020)
    “… In this paper, we investigate an incentive-based cooperation scheme across fog providers. We propose a distributed cooperative algorithm amongst fog computing providers where fully collaborative fog nodes are subject to different loads …”
    Volltext
    Journal Article
  20. 20

    A comparison of the effects of plyometric and virtual training on physical and functional performance: a randomized, controlled, clinical trial von Lobato, Daniel F, Teixeira, Vitória A, Froes, Isabelle, Donzeli, Marina A, Bertoncello, Dernival

    ISSN: 1827-1928, 1827-1928
    Veröffentlicht: Italy 01.01.2021
    Veröffentlicht in The Journal of sports medicine and physical fitness (01.01.2021)
    “… The subjects were randomly assigned to VT (N.=20), PT (N.=18), and control (CG, N.=17) groups. The VT was performed using the Your Body Shape Fitness Evolved 2012 exergame in an Xbox360/Kinetic environment …”
    Weitere Angaben
    Journal Article