Tootfinder

This https://arxiv.org/abs/2501.13862 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Efficient Fermi-Hubbard model ground-state preparation by coupling to a classical reservoir in the instantaneous-response limit
Preparing the ground state of the Fermi-Hubbard model is challenging, in part due to the exponentially large Hilbert space, which complicates efficiently finding a path from an initial state to the ground state using the variational principle. In this work, we propose an approach for ground state preparation of interacting models by involving a classical reservoir, simplified to the instantaneous-response limit, which can be described using a Hamiltonian formalism. The resulting time evolution …

Navigating Phase Transitions with Path-Finding Algorithms: A Strategic Approach to Replica Exchange Monte Carlo
Akie Kowaguchi, Katsuhiro Endo, Kentaro Nomura, Shuichi Kurabayashi, Paul E. Brumby, Kenji Yasuoka
https://arxiv.org/abs/2506.02549

Navigating Phase Transitions with Path-Finding Algorithms: A Strategic Approach to Replica Exchange Monte Carlo
The replica exchange method is a powerful tool for overcoming slow relaxation in molecular simulations, but its efficiency depends strongly on the choice of the number and interval of replicas and their exchange probabilities. Here, we propose a new optimization scheme based on the Dijkstra algorithm that constructs an optimal exchange path by representing replicas and their exchange probabilities as a graph. Inspired by path-finding techniques widely used in computer science, including applica…

An Improved Grey Wolf Optimizer Inspired by Advanced Cooperative Predation for UAV Shortest Path Planning
Zuhao Teng, Qian Dong, Ze Zhang, Shuangyao Huang, Wenzhang Zhang, Jingchen Wang, Ji Li, Xi Chen
https://arxiv.org/abs/2506.03663

An Improved Grey Wolf Optimizer Inspired by Advanced Cooperative Predation for UAV Shortest Path Planning
With the widespread application of Unmanned Aerial Vehicles (UAVs) in domains like military reconnaissance, emergency rescue, and logistics delivery, efficiently planning the shortest flight path has become a critical challenge. Traditional heuristic-based methods often suffer from the inability to escape from local optima, which limits their effectiveness in finding the shortest path. To address these issues, a novel Improved Grey Wolf Optimizer (IGWO) is presented in this study. The proposed …

I bought Rosemary's Baby (eBook). I've always wondered 🤷‍♂️ I've never seen the movie either. The funny thing is, it came as a connection after browsing through the Beastie Boys Wikipedia page, following the path:
Beasty Boys -> Ad-Rock -> Molly Ringwald -> Tempest (1982 film) -> John Cassavetes (1929 - 1989) -> Rosemary's Baby (1968 film) -> Ira Levin (1929 - 2007).
...and then finding out there's a pricier, DRM-ed EPUB2 (2011) vs a little b…

This https://arxiv.org/abs/2412.09433 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCC_…

Solving Multiagent Path Finding on Highly Centralized Networks
The Mutliagent Path Finding (MAPF) problem consists of identifying the trajectories that a set of agents should follow inside a given network in order to reach their desired destinations as soon as possible, but without colliding with each other. We aim to minimize the maximum time any agent takes to reach their goal, ensuring optimal path length. In this work, we complement a recent thread of results that aim to systematically study the algorithmic behavior of this problem, through the paramet…

This https://arxiv.org/abs/2412.08556 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCC_…

Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures
Consider the scenario where multiple agents have to move in an optimal way through a network, each one towards their ending position while avoiding collisions. By optimal, we mean as fast as possible, which is evaluated by a measure known as the makespan of the proposed solution. This is the setting studied in the Multiagent Path Finding problem. In this work, we additionally provide the agents with a way to communicate with each other. Due to size constraints, it is reasonable to assume that t…