6 papers
The Price of Feasibility: Greedy Approximation Bounds for String Supermodular Optimization over Oracle-Conditioned Greedoids
Joan Vendrell Gallart, Russell Bent, Solmaz Kia
Greedy algorithms efficiently approximate combinatorial optimization problems, but their guarantees weaken when feasibility couples combinatorial structure with global physical con…
Submodular Welfare under Routing Coupling: A Hierarchical Decomposition with Perturbation Guarantees
Joan Vendrell Gallart, Nhat-Minh Tang-Nguyen, Alan Kuhnle +1
This paper studies joint submodular welfare maximization and routing over graphs, where agents select items under diminishing returns and transport them through a network with cong…
Chain-based Adaptive Reconfiguration Over Lattices for Hallucination Reduction
Joan Vendrell Gallart, Solmaz Kia, Russell Bent +1
We introduce CAROL (Chain-based Adaptive Reconfiguration Over Lattices), a probabilistic framework for test-time hallucination reduction in large language models. Rather than relyi…
Hierarchical Prompt-Domain Control and Learning for Resource-Constrained Agentic Language Models
Joan Vendrell Gallart, Russell Bent, Michael Grosskopf
Large Language Models are increasingly deployed inside agentic systems, where they must follow structured protocols, adapt to evolving states, and operate under memory, latency, an…
Microgrids optimal radial reconfiguration via FORWARD algorithm
Joan Vendrell Gallart, Russell Bent, Solmaz Kia
Microgrids offer a promising paradigm for integrating distributed energy resources, bolstering energy resilience, and reducing the impact of blackouts. However, their inherent dece…
FORWARD: A Feasible Radial Reconfiguration Algorithm for Multi-Source Distribution Networks
Joan Vendrell Gallart, Russell Bent, Solmaz Kia
This paper considers an optimal radial reconfiguration problem in multi-source distribution networks, where the goal is to find a radial configuration that minimizes quadratic dist…