Suchergebnisse - "randomized algorithm"
-
1
A randomized algorithm based approach to fault detection for uncertain systems subject to deception attack
ISSN: 0016-0032Veröffentlicht: Elsevier Inc 01.12.2024Veröffentlicht in Journal of the Franklin Institute (01.12.2024)“… A randomized algorithm based approach is developed to determine the observer gain and threshold for attaining a trade-off between the false alarm rate (FAR …”
Volltext
Journal Article -
2
A randomized algorithm for natural object colorization
ISSN: 0167-7055, 1467-8659Veröffentlicht: Oxford Blackwell Publishing Ltd 01.05.2014Veröffentlicht in Computer graphics forum (01.05.2014)“… In this paper, we introduce a randomized algorithm which considers not only the value of target color but also the distribution of target color …”
Volltext
Journal Article -
3
A Service System with Packing Constraints: Greedy Randomized Algorithm Achieving Sublinear in Scale Optimality Gap
ISSN: 1946-5238, 1946-5238Veröffentlicht: 01.06.2021Veröffentlicht in Stochastic systems (01.06.2021)“… Multiple customers can be placed for simultaneous service into one server, subject to general packing constraints …”
Volltext
Journal Article -
4
Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints
ISSN: 0257-0130, 1572-9443Veröffentlicht: Boston Springer US 01.02.2015Verö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 -
5
A randomized algorithm for finding a path subject to multiple QoS requirements
ISSN: 1389-1286, 1872-7069Veröffentlicht: Amsterdam Elsevier B.V 01.07.2001Veröffentlicht in Computer networks (Amsterdam, Netherlands : 1999) (01.07.2001)“… ) while efficiently using network resources. In general, finding a path subject to multiple additive constraints (e.g …”
Volltext
Journal Article -
6
The Staircase Mechanism in Differential Privacy
ISSN: 1932-4553, 1941-0484Veröffentlicht: New York IEEE 01.10.2015Veröffentlicht in IEEE journal of selected topics in signal processing (01.10.2015)“… ; the improvement is particularly stark in medium-low privacy regimes. We show that the staircase mechanism is the optimal noise adding mechanism in a universal context, subject to a conjectured technical lemma …”
Volltext
Journal Article -
7
Eductainment: A Gamified Learning Management System for Senior High School Subjects with Randomized Algorithm
Veröffentlicht: IEEE 01.12.2022Veröffentlicht in 2022 2nd International Conference in Information and Computing Research (iCORE) (01.12.2022)“… The study main objectives were to create a gamified mobile learning management system for senior high school subjects with a randomized algorithm entitled: EducTainment …”
Volltext
Tagungsbericht -
8
A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis
ISSN: 0925-5001, 1573-2916Veröffentlicht: New York Springer US 01.11.2023Veröffentlicht in Journal of global optimization (01.11.2023)“… ) into three disjoint subsets V 1 , V 2 , and V 3 such that the sum of edge weights cross different parts is maximized subject to | | V i | - | V l | | ≤ B ( ∀ i ≠ l ∈ { 1 , 2 , 3 …”
Volltext
Journal Article -
9
Distributed Frequency Control via Randomized Response of Electric Vehicles in Power Grid
ISSN: 1949-3029, 1949-3037Veröffentlicht: IEEE 01.01.2016Veröffentlicht in IEEE transactions on sustainable energy (01.01.2016)“… In this paper, we propose a new distributed frequency control scheme for electric vehicles (EVs) to help restore the power grid frequency upon a contingency of …”
Volltext
Journal Article -
10
A Randomized O(log2k)-Competitive Algorithm for Metric Bipartite Matching
ISSN: 0178-4617, 1432-0541Veröffentlicht: Boston Springer US 01.02.2014Veröffentlicht in Algorithmica (01.02.2014)“… )-competitive randomized algorithm for the online metric matching problem. This improves upon the best known guarantee of O (log 3 k …”
Volltext
Journal Article -
11
Classification and Applications of Randomized Functional Numerical Algorithms for the Solution of Second-Kind Fredholm Integral Equations
ISSN: 1072-3374, 1573-8795Veröffentlicht: New York Springer US 01.05.2021Veröffentlicht in Journal of mathematical sciences (New York, N.Y.) (01.05.2021)“… ). Thus, for applied problems related to the solution of second-kind Fredholm integral equations, projection or projection-grid randomized algorithms …”
Volltext
Journal Article -
12
Probabilistic Optimization of Resource Distribution and Encryption for Data Storage in the Cloud
ISSN: 2168-7161, 2372-0018Veröffentlicht: IEEE Computer Society 01.04.2018Veröffentlicht in IEEE transactions on cloud computing (01.04.2018)“… In this paper, we develop a decentralized probabilistic method for performance optimization of cloud services. We focus on Infrastructure-as-a-Service where …”
Volltext
Journal Article -
13
A greedy randomized algorithm achieving sublinear optimality gap in a dynamic packing model
Veröffentlicht: IEEE 01.09.2016Veröffentlicht in 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) (01.09.2016)“… We consider an infinite-server system, where multiple customers can be placed into one server for service simultaneously, subject to packing constraints …”
Volltext
Tagungsbericht -
14
A service system with packing constraints: Greedy randomized algorithm achieving sublinear in scale optimality gap
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 19.11.2020Veröffentlicht in arXiv.org (19.11.2020)“… Multiple customers can be placed for simultaneous service into one server, subject to general packing constraints …”
Volltext
Paper -
15
An infinite server system with general packing constraints: Asymptotic optimality of a greedy randomized algorithm
Veröffentlicht: IEEE 2013Veröffentlicht in 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton) (2013)“… Multiple customers can be placed into one server for service, subject to general "packing" constraints …”
Volltext
Tagungsbericht -
16
Numerical algorithms for personalized search in self-organizing information networks
ISBN: 9780691145037, 0691145032, 1400837065, 9781400837069Veröffentlicht: Princeton, N.J Princeton University Press 2010“… This book lays out the theoretical groundwork for personalized search and reputation management, both on the Web and in peer-to-peer and social networks …”
Volltext
E-Book Buch -
17
On convex parameterization of robust control design for minimizing (conditional) performance at risk
ISSN: 1049-8923, 1099-1239Veröffentlicht: Chichester, UK John Wiley & Sons, Ltd 25.11.2008Veröffentlicht in International journal of robust and nonlinear control (25.11.2008)“… This paper introduces performance at risk and conditional performance at risk as design metrics for the formulation of robust control design. These two metrics …”
Volltext
Journal Article -
18
Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 22.05.2014Veröffentlicht in arXiv.org (22.05.2014)“… There is an infinite number of servers. Multiple customers can be placed for service into one server, subject to general "packing" constraints …”
Volltext
Paper -
19
A randomized algorithm for finding a path subject to multiple QoS constraints
ISBN: 0780357965, 9780780357969Veröffentlicht: IEEE 1999Veröffentlicht in Global Telecommunications Conference (GLOBECOM), 1999 IEEE (1999)“… In general, finding a path subject to multiple additive constraints (e.g., delay, delay-jitter …”
Volltext
Tagungsbericht -
20
A Hitchhiker's guide to statistical tests for assessing randomized algorithms in software engineering
ISSN: 0960-0833, 1099-1689Veröffentlicht: Chichester Blackwell Publishing Ltd 01.05.2014Verö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

