Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Nearchos Potamitis

dblp:377/9755 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Multi-agent systems · 67% Planning, search and constraint satisfaction · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Multi-agent systems
LLM-based multi-agent systems
0.912025
Fleet of Agents: Coordinated Problem Solving with Large Language Models · ICML 2025
Knowledge, reasoning and agents › Multi-agent systems › multi-agent coordination
problem solver coordination
0.912025
Fleet of Agents: Coordinated Problem Solving with Large Language Models · ICML 2025
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
tree search
0.912025
Fleet of Agents: Coordinated Problem Solving with Large Language Models · ICML 2025

Methods — techniques the papers use, named apart from their topics

large language model · 0.9heuristic value function · 0.9genetic-type particle filtering · 0.9
YearPublicationVenuePosition
2025 Fleet of Agents: Coordinated Problem Solving with Large Language Models
abstract
While numerous frameworks have been developed to enhance the reasoning abilities of large language models (LLMs), there is a scarcity of methods that effectively balance the trade-off between cost and quality. In this paper, we introduce Fleet of Agents (FoA), a novel and intuitive yet principled framework utilizing LLMs as agents to navigate through dynamic tree searches, employing a genetic-type particle filtering approach. FoA spawns a multitude of agents, each exploring the search space autonomously, followed by a selection phase where resampling based on a heuristic value function optimizes the balance between exploration and exploitation. This mechanism enables dynamic branching, adapting the exploration strategy based on discovered solutions. We conduct extensive experiments on four benchmark tasks, ‘G̀ame of 24’\’, ‘M̀ini-Crosswords’\’, ‘ẀebShop’\’{and} ‘S̀ciBench’\’, utilizing four different LLMs, GPT-3.5, GPT-4, LLaMA3.2-11B, and LLaMA3.2-90B. On average across all tasks and LLMs, FoA obtains an absolute quality improvement of $\simeq 5%$ while requiring only $\simeq 35%$ of the cost of previous SOTA methods. Notably, our analyses reveal that (1) FoA achieves the best cost-quality trade-off among all benchmarked methods, and (2) FoA+ LLaMA3.2-11B surpasses the Llama3.2-90B model. FoA is publicly available at https://github.com/au-clan/FoA.
Lars Henning Klein, Nearchos Potamitis, Roland C. Aydin, Robert West 0001, Caglar Gulcehre, Akhil Arora 0001
ICML2