Zobrazeno 1 - 10
of 187
pro vyhledávání: '"Kirkpatrick, Scott"'
The chapter starts with a historical summary of first attempts to optimize the spin glass Hamiltonian, comparing it to recent results on searching largest cliques in random graphs. Exact algorithms to find ground states in generic spin glass models a
Externí odkaz:
http://arxiv.org/abs/2301.00683
Autor:
Mishra, Ishaan, Kirkpatrick, Scott
Pulsed laser ablation propulsion has the potential to revolutionize space exploration by eliminating the requirement of a spacecraft to carry its propellant and power source as the high-power laser is situated off-board. More experimentation needs to
Externí odkaz:
http://arxiv.org/abs/2211.09237
Autor:
Marino, Raffaele, Kirkpatrick, Scott
Publikováno v:
Sci Rep 13, 3671 (2023)
Finding a Maximum Clique is a classic property test from graph theory; find any one of the largest complete subgraphs in an Erd\"os-R\'enyi G(N, p) random graph. We use Maximum Clique to explore the structure of the problem as a function of N, the gr
Externí odkaz:
http://arxiv.org/abs/2209.04824
Autor:
Marino, Raffaele, Kirkpatrick, Scott
This paper presents a linear prioritized local algorithm that computes large independent sets on a random $d$-regular graph with small and fixed degree $d$. We studied experimentally the independence ratio obtained by the algorithm when $ d \in [3,10
Externí odkaz:
http://arxiv.org/abs/2003.12293
Autor:
Malandrino, Francesco, Chiasserini, Carla Fabiana, Avino, Giuseppe, Malinverno, Marco, Kirkpatrick, Scott
All the content consumed by mobile users, be it a web page or a live stream, undergoes some processing along the way; as an example, web pages and videos are transcoded to fit each device's screen. The recent multi-access edge computing (MEC) paradig
Externí odkaz:
http://arxiv.org/abs/1809.08536
Autor:
Marino, Raffaele, Kirkpatrick, Scott
Publikováno v:
Scientific Reports 2023
The MaxClique problem, finding the largest complete subgraph in an Erd{\"o}s-R{\'e}nyi $G(N,p)$ random graph in the large $N$ limit, is a well-known example of a simple problem for which finding any approximate solution within a factor of $2$ of the
Externí odkaz:
http://arxiv.org/abs/1807.09091