Concept
Halting problem
Related publications (43)
The Two Times Problem: Where Is the Problem?
Gruber et al. (2022) offered a framework how to explain "Physical time within human time", solving the 'two times problem: Here, I am asking whether such a problem exists at all. To question the question, I will appeal to neurobiological, evolutionary, and ...
Brill2024A ride time-oriented scheduling algorithm for dial-a-ride problems
Nikolaos Geroliminis, Claudia Bongiovanni, Mor Kaspi
This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...
Pergamon-Elsevier Science Ltd2024Complex Representation Learning with Graph Convolutional Networks for Knowledge Graph Alignment
Thanh Trung Huynh, Quoc Viet Hung Nguyen, Thành Tâm Nguyên
The task of discovering equivalent entities in knowledge graphs (KGs), so-called KG entity alignment, has drawn much attention to overcome the incompleteness problem of KGs. The majority of existing techniques learns the pointwise representations of entiti ...
London2023QFT without infinities and hierarchy problem
Sander Johannes Nicolaas Mooij
The standard way to do computations in Quantum Field Theory (QFT) often results in the requirement of dramatic cancellations between contributions induced by a "heavy" sector into the physical observables of the "light" (or low energy) sector - the phenome ...
ELSEVIER2023Discrete Optimal Transport with Independent Marginals is #P-Hard
Daniel Kuhn, Soroosh Shafieezadeh Abadeh, Bahar Taskesen
We study the computational complexity of the optimal transport problem that evaluates the Wasser- stein distance between the distributions of two K-dimensional discrete random vectors. The best known algorithms for this problem run in polynomial time in th ...
2022On Succinct Non-interactive Arguments in Relativized Worlds
Succinct non-interactive arguments of knowledge (SNARKs) are cryptographic proofs with strong efficiency properties. Applications of SNARKs often involve proving computations that include the SNARK verifier, a technique called recursive composition. Unfort ...
SPRINGER INTERNATIONAL PUBLISHING AG2022Genetic-optimised aperiodic code for distributed optical fibre sensors
Luc Thévenaz, Marcelo Alfonso Soto Hernandez, Zhisheng Yang, Simon Adrien Zaslawski, Sheng Wang, Jian Wu
Distributed optical fibre sensors deliver a map of a physical quantity along an optical fibre, providing a unique solution for health monitoring of targeted structures. Considerable developments over recent years have pushed conventional distributed sensor ...
2020Efficient Allocations in Constant Time: Towards Scalable Solutions in the Era of Large Scale Intelligent Systems
Boi Faltings, Panayiotis Danassis
The next technological revolution will be interwoven to the proliferation of intelligent systems. As we bridge the gap between physical and cyber worlds, we will give rise to large-scale, multi-agent based technologies. A key challenge that cities of the f ...
IOS PRESS2020Node Attribute Completion in Knowledge Graphs with Multi-Relational Propagation
Robert West, Eda Bayram, Alberto Garcia Duran
The existing literature on knowledge graph completion mostly focuses on the link prediction task. However, knowledge graphs have an additional incompleteness problem: their nodes possess numerical attributes, whose values are often missing. Our approach, d ...
2020Anytime Heuristic for Weighted Matching Through Altruism-Inspired Behavior
Boi Faltings, Aris Filos Ratsikas, Panayiotis Danassis
We present a novel anytime heuristic (ALMA), inspired by the human principle of altruism, for solving the assignment problem. ALMA is decentralized, completely uncoupled, and requires no communication between the participants. We prove an upper bound on th ...
2019