Risultati della ricerca - routine (algorithm OR (Algorithmics OR Algorithms))

Minimising Total Flowtime in a No-Wait Flow Shop (NWFS) using Genetic Algorithms di Imran Ali Chaudhry

Sommario: “...Minimising Total Flowtime in a No-Wait Flow Shop (NWFS) using Genetic Algorithms Imran Ali Chaudhry...”
Testo
Testo
Testo
Testo
Testo

Randomized adiabatic quantum linear solver algorithm with optimal complexity scaling and detailed running costs di Jennings, David, Lostaglio, Matteo, Pallister, Sam, Sornborger, Andrew T, Subaşı, Yiğit

Sommario: “... across many fields of science, and there is increasing effort to develop quantum linear solver algorithms...”
Testo

Practical Guide to Quantum Computing – Variational Algorithms: Cost Functions (Based on Materials from IBM Q) # 4 di Pavlov, Mikhail

Sommario: “... on the evaluation and implementation of cost functions in variational quantum algorithms (VQAs), based on IBM Q...”
Testo

Algorithm xxx --- ORTHPOL: A package of routines for generating orthogonal polynomials and Gauss-type quadrature rules di Gautschi, Walter

Sommario: “.... The object of these routines is to produce the coefficients in the three-term recurrence relation satisfied...”
Testo

An Improved Quality Hierarchical Congestion Approximator in Near-Linear Time di Henzinger, Monika, Münk, Robin, Räcke, Harald

Sommario: “... gives an HCA with approximation quality $O(\log^{1.5}n \log \log n)$. Among near-linear time algorithms...”
Testo

Engineering Weighted Connectivity Augmentation Algorithms di Faraj, Marcelo Fonseca, Großmann, Ernestine, Joos, Felix, Möller, Thomas, Schulz, Christian

Sommario: “... propose three new heuristic and one exact approach. These include a greedy algorithm considering link...”
Testo

An $O(n^5)$-Time Algorithm for Optimal Broadcast Domination di Papadopoulos, Kleitos

Sommario: “... that is a path or a cycle, and by reducing the general case to an $O(n^6)$-time algorithm. This paper gives...”
Testo

Improved Algorithms for Clustering with Noisy Distance Oracles di Pradhan, Pinki, Bhattacharya, Anup, Jaiswal, Ragesh

Sommario: “...-oracle in the weak-strong oracle model, the authors design approximation algorithms for $k$-means and $k...”
Testo

A simpler QPTAS for scheduling jobs with precedence constraints di Das, Syamantak, Wiese, Andreas

Sommario: “... paper by Graham from 1966 who showed that the simple List Scheduling algorithm is a $(2-\frac{1}{m...”
Testo

Faster Linear-Size And-Or Path and Adder Circuits di Brenner, Ulrich, Silvanus, Anna

Sommario: “... \log_2 \log_2 n)$. Our core routine is a new algorithm for the construction of a circuit for a single...”
Testo

Finding Maximum Weight 2-Packing Sets on Arbitrary Graphs di Borowitz, Jannick, Großmann, Ernestine, Schulz, Christian

Sommario: “... preprocessing routine that exploits the close relation of 2-packing sets to independent sets. This makes well...”
Testo

The Harmonic Policy for Online Buffer Sharing is (2 + ln n)-Competitive: A Simple Proof di Addanki, Vamsi, Dallot, Julien, Kellerhals, Leon, Pacut, Maciej, Schmid, Stefan

Sommario: “.... The problem is to find an algorithm for the switch to accept or reject a packet upon its arrival in order...”
Testo

Data Reductions for the Strong Maximum Independent Set Problem in Hypergraphs di Großmann, Ernestine, Schulz, Christian, Strash, Darren, Wagner, Antonie

Sommario: “... for this problem. Our reduction routine can serve as a preprocessing step for any solver. We analyze the impact...”
Testo

Polynomial Kernel and Incompressibility for Prison-Free Edge Deletion and Completion di Houari-Durand, Séhane Bel, Eiben, Eduard, Wahlström, Magnus

Sommario: “...'$ whose size and parameter value are bounded polynomially in $k$? Although such routines are known...”
Testo

An efficient heuristic for approximate maximum flow computations di Qian, Jingyun, Hahn, Georg

Sommario: “...Several concepts borrowed from graph theory are routinely used to better understand the inner...”
Testo

Replicable Clustering di Esfandiari, Hossein, Karbasi, Amin, Mirrokni, Vahab, Velegkas, Grigoris, Zhou, Felix

Sommario: “...We design replicable algorithms in the context of statistical clustering under the recently...”
Testo

Qubit-Efficient Randomized Quantum Algorithms for Linear Algebra di Wang, Samson, McArdle, Sam, Berta, Mario

Sommario: “...We propose a class of randomized quantum algorithms for the task of sampling from matrix functions...”
Testo

Path Contraction Faster than $2^n$ di Agrawal, Akanksha, Fomin, Fedor V., Lokshtanov, Daniel, Saurabh, Saket, Tale, Prafullkumar

Sommario: “... for it that runs in time $1.88^n\cdot n^{\mathcal{O}(1)}$. The above algorithm is used as a sub-routine in our...”
Testo

Prune, Don't Rebuild: Efficiently Tuning $α$-Reachable Graphs for Nearest Neighbor Search di Zhang, Tian, Padaki, Ashwin, Liang, Jiaming, Ives, Zack, Waingarten, Erik

Sommario: “... databases adopt graph-based approximate nearest neighbor (ANN) search algorithms, such as DiskANN...”
Testo

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization di Su, Yuexin, Zhang, Chenyi, Huang, Peiyuan, Li, Tongyang, Ye, Yinyu

Sommario: “... points using only first-order information by integrating a gradient-based negative-curvature routine...”
Testo