Suchergebnisse - "((\"computing algorithms and informatics\") OR (\"computing algorithms and informally\"))*"

The Computational Advantage of MIP* Vanishes in the Presence of Noise.

Autoren: Dong, Yangjing Fu, Honghao Natarajan, Anand et al.

Quelle: Journal of the ACM; Dec2025, Vol. 72 Issue 6, p1-78, 78p

Schlagwörter: NOISE, COMPUTATIONAL complexity, QUANTUM entanglement, QUANTUM computing, MATRIX functions

CA-DTS: A Distributed and Collaborative Task Scheduling Algorithm for Edge Computing Enabled Intelligent Road Network.

Autoren: Hu, Shi-Hong Luo, Qu-Yuan Li, Guang-Hui et al.

Quelle: Journal of Computer Science & Technology (10009000); Sep2023, Vol. 38 Issue 5, p1113-1131, 19p

Schlagwörter: REINFORCEMENT learning, DEEP reinforcement learning, INTELLIGENT networks, EDGE computing, ALGORITHMS, DISTRIBUTED algorithms, VEHICLE routing problem

COMPUTING PATHS OF LARGE RANK IN PLANAR FRAMEWORKS DETERMINISTICALLY.

Autoren: FOMIN, FEDOR V. GOLOVACH, PETRA. KORHONEN, TUUKKA et al.

Quelle: SIAM Journal on Discrete Mathematics; 2025, Vol. 39 Issue 1, p92-118, 27p

Schlagwörter: DETERMINISTIC algorithms, PLANAR graphs, UNDIRECTED graphs, PROBLEM solving, ALGORITHMS, MATROIDS

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP.

Autoren: Kisfaludi-Bak, Sándor Nederlof, Jesper Węgrzycki, Karol

Quelle: Journal of the ACM; Dec2025, Vol. 72 Issue 6, p1-48, 48p

Schlagwörter: TRAVELING salesman problem, TIME complexity, ALGORITHMS, COMPUTATIONAL complexity, APPROXIMATION theory

Towards Enhancing Energy Consumption and Time Complexity of Combinatorial Algorithms for Solving the Knapsack Problem.

Autoren: Kanoma, Saminu Isah Bin Usman, Bashar Gabi, Danlami et al.

Quelle: International Journal of Science for Global Sustainability (IJSGS); Dec2024, Vol. 10 Issue 4, p20-27, 8p

Schlagwörter: COMBINATORIAL optimization, GREEDY algorithms, DYNAMIC programming, ENERGY consumption, RESOURCE allocation

On the dissertation "Scalable SAT Solving and its Application".

Autoren: Schreiber, Dominik

Quelle: IT: Information Technology; Feb2025, Vol. 67 Issue 1, p46-53, 8p

Schlagwörter: ACADEMIC dissertations, DISTRIBUTED algorithms, AUTOMATED planning & scheduling, CLOUD computing, COMPUTER science

RAFDivider: a distributed algorithm for computing semantics in higher-order abstract argumentation frameworks.

Autoren: Doutre, Sylvie Lagasquie-Schiex, Marie-Christine

Quelle: Journal of Applied Non-Classical Logics; 2023, Vol. 33 Issue 3/4, p244-297, 54p

Schlagwörter: DISTRIBUTED algorithms, DISTRIBUTED computing, SEMANTICS, MANURES, OPEN-ended questions

Hyperdimensional computing: A fast, robust, and interpretable paradigm for biological data.

Autoren: Stock, Michiel Van Criekinge, Wim Boeckaerts, Dimitri et al.

Quelle: PLoS Computational Biology; 9/24/2024, Vol. 20 Issue 9, p1-23, 23p

Schlagwörter: DEEP learning, BIOINFORMATICS, ALGORITHMS, PHYLOGENY

Quantum, post-quantum, and blockchain approaches for securing the internet of medical things: a systematic review.

Autoren: Akkal, Maroua Cherbal, Sarra Annane, Boubakeur et al.

Quelle: Cluster Computing; Oct2025, Vol. 28 Issue 10, p1-45, 45p

Schlagwörter: QUANTUM computing, INTERNET of medical things, MEDICAL technology, QUANTUM cryptography, BLOCKCHAINS

The canonical amoebot model: algorithms and concurrency control.

Autoren: Daymude, Joshua J. Richa, Andréa W. Scheideler, Christian

Quelle: Distributed Computing; Jun2023, Vol. 36 Issue 2, p159-192, 34p

Schlagwörter: ALGORITHMS, SEQUENTIAL analysis, DISTRIBUTED computing, MESSAGE passing (Computer science)

Exploring academic influence of algorithms by co-occurrence network based on full-text of academic papers.

Autoren: Wang, Yuzhuo Zhang, Chengzhi Song, Min et al.

Quelle: Aslib Journal of Information Management; 2025, Vol. 77 Issue 4, p651-680, 30p

Schlagwörter: NATURAL language processing, ARTIFICIAL intelligence, ALGORITHMS, POPULARITY, DEEP learning

The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability.

Autoren: Rada, M. Černý, M. Sokol, O.

Quelle: Computational Complexity; Dec2024, Vol. 33 Issue 2, p1-32, 32p

Theory and Applications of Quantum Hashing.

Autoren: Ablayev, Farid Khadiev, Kamil Vasiliev, Alexander et al.

Quelle: Quantum Reports; Jun2025, Vol. 7 Issue 2, p24-N.PAG, 30p

Schlagwörter: QUANTUM cryptography, QUANTUM computing, QUANTUM wells, QUANTUM theory, SYNONYMS

Flow-augmentation I: Directed graphs.

Autoren: Kim, Eun Jung Kratsch, Stefan Pilipczuk, Marcin et al.

Quelle: Journal of the ACM; Feb2025, Vol. 72 Issue 1, p1-38, 38p

Schlagwörter: POLYNOMIAL time algorithms, GRAPH algorithms, CUTTING stock problem, INTEGERS, LOGICAL prediction, DIRECTED graphs

The power of locality: Exploring the limits of randomness in distributed computing.

Autoren: Maus, Yannic

Quelle: IT: Information Technology; Oct2020, Vol. 62 Issue 5, p271-278, 8p

Schlagwörter: DISTRIBUTED computing, DETERMINISTIC algorithms, DISTRIBUTED algorithms, GRAPH coloring

PyGTED: Python Application for Computing Graph Traversal Edit Distance.

Autoren: Ebrahimpour Boroojeny, Ali Shrestha, Akash Sharifi-zarchi, Ali et al.

Quelle: Journal of Computational Biology. Mar2020, Vol. 27 Issue 3, p436-439. 4p.

Schlagwörter: *POLYNOMIAL time algorithms, *MATHEMATICAL sequences, *PYTHON programming language, *DATA mining

Security importance of edge-IoT ecosystem: An ECC-based authentication scheme.

Autoren: Alzahrani, Naif

Quelle: PLoS ONE; 6/4/2025, Vol. 20 Issue 6, p1-25, 25p

Schlagwörter: TIME complexity, ELECTRONIC data processing, COMPUTER performance, DATA security failures, COMPUTATIONAL complexity, CLOUD computing, EDGE computing

Deterministic fault-tolerant connectivity labeling scheme: Deterministic fault-tolerant connectivity labeling scheme: T. Izumi et al.

Autoren: Izumi, Taisuke Emek, Yuval Wadayama, Tadashi et al.

Quelle: Distributed Computing; Mar2025, Vol. 38 Issue 1, p31-50, 20p

Schlagwörter: ERROR-correcting codes, GRAPH algorithms, GRAPH labelings, DATABASES, POLYNOMIAL time algorithms

Jump Restore Light Transport.

Autoren: Holl, Sascha Singh, Gurprit Seidel, Hans-Peter

Quelle: ACM Transactions on Graphics; Dec2025, Vol. 44 Issue 6, p1-13, 13p

Schlagwörter: MARKOV chain Monte Carlo, COMPUTER graphics, STATE-space methods, STATISTICAL sampling, PARALLEL algorithms, LIGHT propagation, OPTIMIZATION algorithms

FASTER APPROXIMATION ALGORITHMS FOR COMPUTING SHORTEST CYCLES ON WEIGHTED GRAPHS.

Autoren: DUCOFFE, GUILLAUME

Quelle: SIAM Journal on Discrete Mathematics; 2021, Vol. 35 Issue 2, p953-969, 17p

Schlagwörter: APPROXIMATION algorithms, WEIGHTED graphs, DETERMINISTIC algorithms, INTEGERS