Results 51 to 60 of about 1,703,727 (282)

Formal Analysis of Online Algorithms [PDF]

, 2011
In [2], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in R≥0.
Benjamin Aminof, Orna Kupferman, and Robby Lampert.   +2 more
openaire   +1 more source

Analysing the significance of small conformational changes and low occupancy states in serial crystallographic data

FEBS Open Bio, EarlyView.
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill, Yelyzaveta Pulnova, Elke De Zitter, Helen M. Ginn, Briony A. Yorke   +4 more
wiley   +1 more source

Optimal web-scale tiering as a flow problem [PDF]

, 2010
We present a fast online solver for large scale parametric max-flow problems as they occur in portfolio optimization, inventory management, computer vision, and logistics. Our algorithm solves an integer linear program in an online fashion.
Leung, Gilbert, Quadrianto, Novi, Smola, Alexander, Tsioutsiouliklis, Kostas   +3 more
core   +1 more source

Asymptotically-Optimal Incentive-Based En-Route Caching Scheme

, 2014
Content caching at intermediate nodes is a very effective way to optimize the operations of Computer networks, so that future requests can be served without going back to the origin of the content.
Gharaibeh, Ammar, Khalil, Issa, Khreishah, Abdallah, Wu, Jie   +3 more
core   +1 more source

Cracking the Code: Genotype–Phenotype Correlation Models in Sarcoglycanopathies

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Sarcoglycanopathies are among the most severe limb‐girdle muscular dystrophies (LGMD), though milder presentations have been described. These diseases are primarily caused by missense variants, but the limited predictability of their effect on protein maturation, complex formation, and transport has hindered reliable genotype ...
Leonela Luce, Goknur Selen Kocak, José Verdú‐Díaz, Jorge Alonso‐Pérez, Kristl G. Claeys, Tanya Stojkovic, Gorka Fernández‐Eulate, Pascal Laforêt, Najoua Miladi, Filipe Di Pace, Cristiane Araujo Martins Moreno, Edmar Zanoteli, Conrad C. Weihl, Volker Straub, Ana Töpf, Jordi Díaz‐Manera, Sarcoglycan European Cohort Consortium, Adele D′Amico, Adolfo López de Munain, Alicia Alonso‐Jiménez, Ana Camacho‐Salas, Andrea Gangfuß, Andrés Nascimento, Anna Sarkozy, Anneke J. van der Kooi, Arturo Fraga‐Bau, Béla Melegh, Benedikt Schoser, Bjarne Udd, Blaz Koritnik, Carlos Ortez, Chiara Marini Bettolo, Chiara Panicucci, Claudia Weiss, Claudio Bruno, Claudio Semplicini, Cristina Dominguez‐González, Cristina Garrido, David Gómez‐Andrés, Edoardo Malfatti, Elena Pegoraro, Elke De Vos, Francina Munell, Gabriele Dekomien, Giacomo Pietro Comi, Giorgio Tasca, Isabelle Richard, Jan L. De Bleecker, Jana Haberlová, Jesper Helbo Storgaard, Johanna Palmio, John Vissing, Juan Carlos de Leon‐Hernández, Kinga Hadzsiev, Laura Costa‐Comellas, Lea Leonardis, Leroy ten Dam, Lidia González‐Quereda, Luca Bello, Luisa Politano, Manuela Santos, Marianne de Visser, Marie Rohlenová, Matteo Garibaldi, Michela Guglieri, Nicolas Deconinck, Nicoline Løkken, Omar Abdel‐Mannan, Pia Gallano, Roberto Fernández‐Torrón, Ulrike Schara‐Schmidt, Vincenzo Nigro, Vittoria Zangaro   +72 more
wiley   +1 more source

A Selectable Sloppy Heap

Algorithms, 2019
We study the selection problem, namely that of computing the ith order statistic of n given elements. Here we offer a data structure called selectable sloppy heap that handles a dynamic version in which upon request (i) a new element is inserted or (ii ...
Adrian Dumitrescu
doaj   +1 more source

A Match in Time Saves Nine: Deterministic Online Matching With Delays

, 2017
We consider the problem of online Min-cost Perfect Matching with Delays (MPMD) introduced by Emek et al. (STOC 2016). In this problem, an even number of requests appear in a metric space at different times and the goal of an online algorithm is to match ...
A Antoniadis, A Borodin, A Gupta, A Mehta, A Mehta, AE Elo, AR Karlin, AR Karlin, B Birnbaum, B Fuchs, B Kalyanasundaram, C Brito, DR Dooly, E Koutsoupias, EM Reingold, J Fakcharoenphol, M Bienkowski, M Chrobak, N Bansal, N Bansal, N Buchbinder, O Delalleau, S Albers, S Khanna, S Khuller, Y Emek, YA Pignolet   +26 more
core   +1 more source

Online metaheuristic algorithm selection

Expert Systems with Applications, 2022
The performance of optimization algorithms significantly depends on the landscape of the problems. It is known that there is no single algorithm that outperforms others on problems with different fitness landscapes. One of the issues in metaheuristic algorithms is keeping the balance between exploration and exploitation.
Kazem Meidani, Seyedali Mirjalili, Amir Barati Farimani   +2 more
openaire   +2 more sources

Health Care Use Among Patients Presenting to Emergency Department for Gout Flares in Ontario, Canada: A Population‐based Health Systems Analysis

Arthritis Care &Research, Accepted Article.
Objective We characterized emergency department (ED) gout visits and identified patient characteristics and health services patterns contributing to ED presentations. Methods We conducted a population‐based study of ED gout visits in Ontario, Canada between 2014 and 2023.
Timothy S.H. Kwok, Samantha Morais, William K. Silverstein, Clare L. Atzema, Gregory Choy, Priyanka Chandratre, Ping Li, Jessica Widdifield   +7 more
wiley   +1 more source

Online Meta-learning by Parallel Algorithm Competition

, 2017
The efficiency of reinforcement learning algorithms depends critically on a few meta-parameters that modulates the learning updates and the trade-off between exploration and exploitation.
Baker James E., Bertsekas D. P., Downey Carlton, Gabillon V., Goodfellow Ian, Mnih Volodymyr, Snoek Jasper, Snoek Jasper, Springenberg Jost T., Sutton S., Sutton S., Szita I., Unemi T., Wu Jian   +13 more
core   +1 more source