Výsledky vyhledávání - "Randomised algorithms"

Upřesnit hledání
  1. 1

    Randomised subspace system identification: complexities and error bounds Autor Kedia, Vatsal, Chakraborty, Debraj

    ISSN: 0020-7179, 1366-5820
    Vydáno: Abingdon Taylor & Francis 02.12.2025
    Vydáno v International journal of control (02.12.2025)
    “…Recently, a novel randomised subspace system identification method (RandSID) for estimating LTI state-space models was proposed in Kedia, V., & Chakraborty, D…”
    Získat plný text
    Journal Article
  2. 2
  3. 3

    Control analysis and design via randomised coordinate polynomial minimisation Autor Calafiore, Giuseppe C., Novara, Carlo, Possieri, Corrado

    ISSN: 0020-7179, 1366-5820
    Vydáno: Abingdon Taylor & Francis 02.01.2022
    Vydáno v International journal of control (02.01.2022)
    “…A relevant family of control analysis and design problems can be reduced to the minimisation of a multivariate polynomial objective over a semialgebraic set…”
    Získat plný text
    Journal Article
  4. 4

    Longest Common Substring with Approximately k Mismatches Autor Kociumaka, Tomasz, Radoszewski, Jakub, Starikovskaya, Tatiana

    ISSN: 0178-4617, 1432-0541
    Vydáno: New York Springer US 01.06.2019
    Vydáno v Algorithmica (01.06.2019)
    “…In the longest common substring problem, we are given two strings of length n and must find a substring of maximal length that occurs in both strings. It is…”
    Získat plný text
    Journal Article
  5. 5

    Optimisation-based switch allocation to improve energy losses and service restoration in radial electrical distribution systems Autor López, Juan Camilo, Franco, John Fredy, Rider, Marcos J

    ISSN: 1751-8687, 1751-8695
    Vydáno: The Institution of Engineering and Technology 04.08.2016
    “…This study presents a new methodology for the optimal allocation of switching devices in radial electrical distribution systems (EDSs). A specialised greedy…”
    Získat plný text
    Journal Article
  6. 6

    Verified Analysis of Random Binary Tree Structures Autor Eberl, Manuel, Haslbeck, Max W., Nipkow, Tobias

    ISSN: 0168-7433, 1573-0670
    Vydáno: Dordrecht Springer Netherlands 01.06.2020
    Vydáno v Journal of automated reasoning (01.06.2020)
    “…This work is a case study of the formal verification and complexity analysis of some famous probabilistic algorithms and data structures in the proof assistant…”
    Získat plný text
    Journal Article
  7. 7

    A probabilistic solution of robust H∞ control problem with scaled matrices Autor Xie, R., Gong, J.Y.

    ISSN: 0020-7721, 1464-5319
    Vydáno: Taylor & Francis 26.07.2016
    “…This paper addresses the robust H ∞ control problem with scaled matrices. It is difficult to find a global optimal solution for this non-convex optimisation…”
    Získat plný text
    Journal Article
  8. 8

    On a new generalised LMI condition and randomised algorithm for robust stabilisation via static-output-feedback Autor Peretz, Y., Merzbach, O., Moyall, S.

    ISSN: 0020-7721, 1464-5319
    Vydáno: London Taylor & Francis 02.01.2020
    “…For a given system with time-invariant affine uncertainties, ranging in a unit hypercube or, equivalently, in a hyper-rectangle, new LMI sufficient conditions…”
    Získat plný text
    Journal Article
  9. 9

    A randomised algorithm for computing static-output-feedbacks for large-scale systems Autor Peretz, Y., Wu, W.

    ISSN: 0020-7721, 1464-5319
    Vydáno: London Taylor & Francis 10.12.2019
    “…A randomised algorithm is proposed for computing globally optimal static-output-feedbacks for large-scale systems. The algorithm is based on the Ray-Shooting…”
    Získat plný text
    Journal Article
  10. 10

    Design of a randomised arrangement AMC surfaces for RCS reduction based on equivalent circuit modelling Autor Varkani, Ali Ramezani, Firouzeh, Zaker Hossein, Nezhad, Abolghasem Zeidaabadi

    ISSN: 1751-8725, 1751-8733
    Vydáno: The Institution of Engineering and Technology 15.08.2018
    “…This study aims to present a thin and broadband meta-surface for both mono-static and bi-static radar cross-section (RCS) reduction being able to operate in…”
    Získat plný text
    Journal Article
  11. 11

    A randomised approach for NARX model identification based on a multivariate Bernoulli distribution Autor Bianchi, F., Falsone, A., Prandini, M., Piroddi, L.

    ISSN: 0020-7721, 1464-5319
    Vydáno: London Taylor & Francis 26.04.2017
    “…The identification of polynomial NARX models is typically performed by incremental model building techniques. These methods assess the importance of each…”
    Získat plný text
    Journal Article
  12. 12

    Pattern matching with don't cares and few errors Autor Clifford, Raphaël, Efremenko, Klim, Porat, Ely, Rothschild, Amir

    ISSN: 0022-0000, 1090-2724
    Vydáno: Elsevier Inc 01.03.2010
    “…We present solutions for the k-mismatch pattern matching problem with don't cares. Given a text t of length n and a pattern p of length m with don't care…”
    Získat plný text
    Journal Article
  13. 13

    Randomised block-coordinate Frank-Wolfe algorithm for distributed online learning over networks Autor Li, Jingchao, Wu, Qingtao, Zheng, Ruijuan, Zhu, Junlong, Ge, Quanbo, Zhang, Mingchuan

    ISSN: 2517-7567, 1873-9601, 2517-7567, 1873-961X
    Vydáno: Dordrecht The Institution of Engineering and Technology 01.06.2020
    Vydáno v Cognitive computation and systems (01.06.2020)
    “…The distributed online algorithms which are based on the Frank-Wolfe method can effectively deal with constrained optimisation problems. However, the…”
    Získat plný text
    Journal Article
  14. 14

    On applications of the ray-shooting method for structured and structured-sparse static-output-feedbacks Autor Peretz, Y.

    ISSN: 0020-7721, 1464-5319
    Vydáno: London Taylor & Francis 04.07.2017
    “…A randomised optimisation method, called the ray-shooting method that efficiently solves the minimisation problem of continuous functions over compact…”
    Získat plný text
    Journal Article
  15. 15

    A non-uniform birthday problem with applications to discrete logarithms Autor Galbraith, Steven D., Holmes, Mark

    ISSN: 0166-218X, 1872-6771
    Vydáno: Elsevier B.V 01.07.2012
    Vydáno v Discrete Applied Mathematics (01.07.2012)
    “…We consider a generalisation of the birthday problem that arises in the analysis of algorithms for certain variants of the discrete logarithm problem in…”
    Získat plný text
    Journal Article
  16. 16

    Development of a randomized 3D cell model for Monte Carlo microdosimetry simulations Autor Douglass, Michael, Bezak, Eva, Penfold, Scott

    ISSN: 0094-2405, 2473-4209
    Vydáno: United States American Association of Physicists in Medicine 01.06.2012
    Vydáno v Medical physics (Lancaster) (01.06.2012)
    “…Purpose: The objective of the current work was to develop an algorithm for growing a macroscopic tumor volume from individual randomized quasi-realistic cells…”
    Získat plný text
    Journal Article
  17. 17

    Balls into non-uniform bins Autor Berenbrink, Petra, Brinkmann, André, Friedetzky, Tom, Nagel, Lars

    ISSN: 0743-7315, 1096-0848
    Vydáno: Amsterdam Elsevier Inc 01.02.2014
    “…Balls-into-bins games for uniform bins are widely used to model randomised load balancing strategies. Recently, balls-into-bins games have been analysed under…”
    Získat plný text
    Journal Article
  18. 18

    Robust stabilisation of time-varying delay systems with probabilistic uncertainties Autor Jiang, Ning, Xiong, Junlin, Lam, James

    ISSN: 0020-7721, 1464-5319
    Vydáno: Taylor & Francis 09.09.2016
    “…For robust stabilisation of time-varying delay systems, only sufficient conditions are available to date. A natural question is as follows: if the existing…”
    Získat plný text
    Journal Article
  19. 19

    A simple randomised algorithm for convex optimisation: Application to two-stage stochastic programming Autor Dyer, M., Kannan, R., Stougie, L.

    ISSN: 0025-5610, 1436-4646
    Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2014
    Vydáno v Mathematical programming (01.10.2014)
    “…We consider maximising a concave function over a convex set by a simple randomised algorithm. The strength of the algorithm is that it requires only…”
    Získat plný text
    Journal Article
  20. 20

    Almost Stable Matchings by Truncating the Gale–Shapley Algorithm Autor Floréen, Patrik, Kaski, Petteri, Polishchuk, Valentin, Suomela, Jukka

    ISSN: 0178-4617, 1432-0541
    Vydáno: New York Springer-Verlag 01.09.2010
    Vydáno v Algorithmica (01.09.2010)
    “…We show that the ratio of matched individuals to blocking pairs grows linearly with the number of propose–accept rounds executed by the Gale–Shapley algorithm…”
    Získat plný text
    Journal Article