Suchergebnisse - distributes evolution (algorithm OR (algorithmics OR algorithmics))

Quantum Markov Chain Monte Carlo for Cosmological Functions von Sarracino, Giuseppe, Cardone, Vincenzo Fabrizio, Scaramella, Roberto, Riccio, Giuseppe, Bulgarelli, Andrea, Burigana, Carlo, Cappelli, Luca, Cavuoti, Stefano, Farsian, Farida, Graziotti, Irene, Meneghetti, Massimo, Murante, Giuseppe, Parmiggiani, Nicolò, Rizzo, Alessandro, Schillirò, Francesco, Testa, Vincenzo, Trombetti, Tiziana

Inhaltsangabe: “… with an application to cosmological functions, to derive posterior distributions from cosmological probes …”
Volltext

A Conditional Abundance Matching Method of Extending Simulated Halo Merger Trees to Resolve Low-Mass Progenitors and Sub-halos von Chen, Yangyao, Mo, H. J., Li, Cheng, Wang, Kai, Wang, Huiyuan, Yang, Xiaohu

Inhaltsangabe: “… We present an algorithm to extend subhalo merger trees in a low-resolution dark-matter-only …”
Volltext

Leveraging Analog Quantum Computing with Neutral Atoms for Solvent Configuration Prediction in Drug Discovery von D'Arcangelo, Mauro, Loco, Daniele, team, Fresnel, Gouraud, Nicolaï, Angebault, Stanislas, Sueiro, Jules, Monmarché, Pierre, Forêt, Jérôme, Henry, Louis-Paul, Henriet, Loïc, Piquemal, Jean-Philip

Inhaltsangabe: “… We introduce quantum algorithms able to sample equilibrium water solvent molecules configurations …”
Volltext

Fast simulations of X-ray absorption spectroscopy for battery materials on a quantum computer von Fomichev, Stepan, Casares, Pablo A. M., Soni, Jay, Azad, Utkarsh, Kunitsa, Alexander, Voigt, Arne-Christian, Mueller, Jonathan E., Arrazola, Juan Miguel

Inhaltsangabe: “… evolution error bound. The third is the choice of an optimized distribution of samples that takes advantage …”
Volltext

Using Linearized Optimal Transport to Predict the Evolution of Stochastic Particle Systems von Karris, Nicholas, Nikitopoulos, Evangelos A., Kevrekidis, Ioannis G., Lee, Seungjoon, Cloninger, Alexander

Inhaltsangabe: “… We develop an Euler-type method to predict the evolution of a time-dependent probability measure …”
Volltext

Multivariate Probabilistic CRPS Learning with an Application to Day-Ahead Electricity Prices von Berrisch, Jonathan, Ziel, Florian

Inhaltsangabe: “… matrices and penalized smoothing. The new online learning algorithm generalizes the standard CRPS learning …”
Volltext

Classical Machine Learning: Seventy Years of Algorithmic Learning Evolution von Ezugwu, Absalom E., Ho, Yuh-Shan, Egwuche, Ojonukpe S., Ekundayo, Olufisayo S., Van Der Merwe, Annette, Saha, Apu K., Pal, Jayanta

Inhaltsangabe: “… . This study provides a comprehensive overview of the evolution of traditional learning algorithms …”
Volltext

Pinching Antenna-Aided Wireless Powered Communication Networks von Li, Yixuan, Xu, Hongbo, Zeng, Ming, Liu, Yuanwei

Inhaltsangabe: “… -complexity stochastic parameter differential evolution (SPDE) algorithm. Numerical results validate …”
Volltext

Improved Bounds for Context-Dependent Evolutionary Models Using Sequential Monte Carlo von Mathews, Joseph, Schmidler, Scott C.

Inhaltsangabe: “… for a Markov chain Monte Carlo algorithm that samples the conditional distribution over latent sample …”
Volltext

Discovering Temporally-Aware Reinforcement Learning Algorithms von Jackson, Matthew Thomas, Lu, Chris, Kirsch, Louis, Lange, Robert Tjarko, Whiteson, Shimon, Foerster, Jakob Nicolaus

Inhaltsangabe: “… learning algorithms parameterized by surrogate objective functions. To improve upon manually designed …”
Volltext

A convex approach for Markov chain estimation from aggregate data via inverse optimal transport von Mascherpa, Michele, Ringh, Axel, Taghvaei, Amirhossein, Karlsson, Johan

Inhaltsangabe: “… We address the problem of identifying the dynamical law governing the evolution of a population …”
Volltext

Simulating Evolvability as a Learning Algorithm: Empirical Investigations on Distribution Sensitivity, Robustness, and Constraint Tradeoffs von Fidalgo, Nicholas, Ye, Puyuan

Inhaltsangabe: “… The theory of evolvability, introduced by Valiant (2009), formalizes evolution as a constrained …”
Volltext

Bypassing the Noisy Parity Barrier: Learning Higher-Order Markov Random Fields from Dynamics von Gaitonde, Jason, Moitra, Ankur, Mossel, Elchanan

Inhaltsangabe: “… distribution is intractable unless $\mathsf{NP}=\mathsf{RP}$, and moreover, any algorithm to learn from i.i.d …”
Volltext

Restarting the Numerical Flow Iteration through low rank tensor approximations von Wilhelm, Rostislav-Paul, Kormann, Katharina

Inhaltsangabe: “… for the Vlasov--Poisson system. It stores the temporal evolution of the electric field and reconstructs …”
Volltext

Evolvable Conditional Diffusion von Wei, Zhao, Ooi, Chin Chun, Gupta, Abhishek, Wong, Jian Cheng, Chiu, Pao-Hsiung, Toh, Sheares Xue Wen, Ong, Yew-Soon

Inhaltsangabe: “… function through updates to the descriptive statistic for the denoising distribution, and derive …”
Volltext

Measuring Epistemic Unfairness for Algorithmic Decision-Making von Quaresmini, Camilla, Piccinin, Lisa, Breschi, Valentina

Inhaltsangabe: “… in algorithmic environments. First, we introduce a deficit-based template that models epistemic injustices …”
Volltext

Determining probability density functions with adiabatic quantum computing von Robbiati, Matteo, Cruz-Martinez, Juan M., Carrazza, Stefano

Inhaltsangabe: “… to each other. In this work, we present a method for fitting one-dimensional probability distributions …”
Volltext

Optimal Quantum Likelihood Estimation von Levi, Alon, Ossi, Ziv, Cohen, Eliahu, Te'eni, Amit

Inhaltsangabe: “… A hybrid quantum-classical algorithm is a computational scheme in which quantum circuits are used …”
Volltext

A Brief Survey of Formal Models of Concurrency von Averill, Charles

Inhaltsangabe: “… algorithms, a cornerstone of networking, is a longstanding area of research in which models and frameworks …”
Volltext

Distributed Architecture Reconstruction of Polyglot and Multi-Repository Microservice Projects von Manglaras, Oscar, Farkas, Alex, Woolford, Thomas, Treude, Christoph, Wagner, Markus

Inhaltsangabe: “… to maintain due to the rapid, independent evolution of services. While static architecture reconstruction …”
Volltext