Resultados de búsqueda - routine (algorithm OR (Algorithms OR Algorithmics))

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

Tabla de Contenidos: “…Minimising Total Flowtime in a No-Wait Flow Shop (NWFS) using Genetic Algorithms Imran Ali Chaudhry…”
Enlace del recurso
Enlace del recurso
Enlace del recurso
Enlace del recurso
Enlace del recurso

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

Tabla de Contenidos: “… across many fields of science, and there is increasing effort to develop quantum linear solver algorithms…”
Enlace del recurso

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

Tabla de Contenidos: “… on the evaluation and implementation of cost functions in variational quantum algorithms (VQAs), based on IBM Q…”
Enlace del recurso

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

Tabla de Contenidos: “…. The object of these routines is to produce the coefficients in the three-term recurrence relation satisfied…”
Enlace del recurso

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

Tabla de Contenidos: “… gives an HCA with approximation quality $O(\log^{1.5}n \log \log n)$. Among near-linear time algorithms…”
Enlace del recurso

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

Tabla de Contenidos: “… propose three new heuristic and one exact approach. These include a greedy algorithm considering link…”
Enlace del recurso

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

Tabla de Contenidos: “… that is a path or a cycle, and by reducing the general case to an $O(n^6)$-time algorithm. This paper gives…”
Enlace del recurso

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

Tabla de Contenidos: “…-oracle in the weak-strong oracle model, the authors design approximation algorithms for $k$-means and $k…”
Enlace del recurso

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

Tabla de Contenidos: “… paper by Graham from 1966 who showed that the simple List Scheduling algorithm is a $(2-\frac{1}{m…”
Enlace del recurso

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

Tabla de Contenidos: “… \log_2 \log_2 n)$. Our core routine is a new algorithm for the construction of a circuit for a single…”
Enlace del recurso

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

Tabla de Contenidos: “… preprocessing routine that exploits the close relation of 2-packing sets to independent sets. This makes well…”
Enlace del recurso

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

Tabla de Contenidos: “…. The problem is to find an algorithm for the switch to accept or reject a packet upon its arrival in order…”
Enlace del recurso

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

Tabla de Contenidos: “… for this problem. Our reduction routine can serve as a preprocessing step for any solver. We analyze the impact…”
Enlace del recurso

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

Tabla de Contenidos: “…'$ whose size and parameter value are bounded polynomially in $k$? Although such routines are known…”
Enlace del recurso

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

Tabla de Contenidos: “…Several concepts borrowed from graph theory are routinely used to better understand the inner…”
Enlace del recurso

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

Tabla de Contenidos: “…We design replicable algorithms in the context of statistical clustering under the recently…”
Enlace del recurso

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

Tabla de Contenidos: “…We propose a class of randomized quantum algorithms for the task of sampling from matrix functions…”
Enlace del recurso

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

Tabla de Contenidos: “… 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…”
Enlace del recurso

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

Tabla de Contenidos: “… databases adopt graph-based approximate nearest neighbor (ANN) search algorithms, such as DiskANN…”
Enlace del recurso

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

Tabla de Contenidos: “… points using only first-order information by integrating a gradient-based negative-curvature routine…”
Enlace del recurso