Search Results - "Randomised algorithms"

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

“…Recently, a novel randomised subspace system identification method (RandSID) for estimating LTI state-space models was proposed in Kedia, V., & Chakraborty, D…”
Get full text

Random-prime–fixed-vector randomised lattice-based algorithm for high-dimensional integration by Kuo, Frances Y., Nuyens, Dirk, Wilkes, Laurence

Get full text

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

“…A relevant family of control analysis and design problems can be reduced to the minimisation of a multivariate polynomial objective over a semialgebraic set…”
Get full text

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

“…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…”
Get full text

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

“…This study presents a new methodology for the optimal allocation of switching devices in radial electrical distribution systems (EDSs). A specialised greedy…”
Get full text

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

“…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…”
Get full text

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

“…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…”
Get full text

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

“…For a given system with time-invariant affine uncertainties, ranging in a unit hypercube or, equivalently, in a hyper-rectangle, new LMI sufficient conditions…”
Get full text

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

“…A randomised algorithm is proposed for computing globally optimal static-output-feedbacks for large-scale systems. The algorithm is based on the Ray-Shooting…”
Get full text

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

“…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…”
Get full text

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

“…The identification of polynomial NARX models is typically performed by incremental model building techniques. These methods assess the importance of each…”
Get full text

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

“…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…”
Get full text

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

“…The distributed online algorithms which are based on the Frank-Wolfe method can effectively deal with constrained optimisation problems. However, the…”
Get full text

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

“…A randomised optimisation method, called the ray-shooting method that efficiently solves the minimisation problem of continuous functions over compact…”
Get full text

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

“…We consider a generalisation of the birthday problem that arises in the analysis of algorithms for certain variants of the discrete logarithm problem in…”
Get full text

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

“…Purpose: The objective of the current work was to develop an algorithm for growing a macroscopic tumor volume from individual randomized quasi-realistic cells…”
Get full text

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

“…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…”
Get full text

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

“…For robust stabilisation of time-varying delay systems, only sufficient conditions are available to date. A natural question is as follows: if the existing…”
Get full text

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

“…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…”
Get full text

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

“…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…”
Get full text