ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “complex tasks”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.AIRecentJun 1, 2026

SMH-Bench: Benchmarking LLM Agents for Environment-Grounded Reasoning and Action in Smart Homes

Kuan Li, Shuo Zhang, Huacan Wang, Fangzhou Yu +11 more

The paper introduces SMH-Bench, a comprehensive benchmark built on a simulator to rigorously test LLM agents' ability to perform complex, environment-grounded reasoning and actions in realistic smart-…

View →
cs.HCEmpiricalRecentJul 22, 2026

A Task Taxonomy for Edge and Trail Bundling

Markus Wallinger, Stephen G. Kobourov

The paper assembles a corpus of 102 papers on edge bundling and derives a task taxonomy for reasoning about bundled visualizations.

View →
cs.HCEmpiricalRecentOct 19, 2026

From Tasks to Turns: Measuring Human Labor Contributions in Human-Agent Joint Production

Likai Wang, Dezhao Su, Jing Hu, Yunyun Wan +2 more

A framework for measuring human contributions in human-agent joint production is proposed.

View →
cs.CCcs.DSTheoreticalRecentOct 26, 2026

The Complexity of Value Optimization in Sporadic Task Systems

Christopher Harbourne, Nathan Fisher, Kecheng Yang, Pontus Ekberg +2 more

This paper studies the complexity of Value-based Task Selection (VTS) in real-time systems.

View →
cs.ROEmpiricalRecentJun 23, 2026

Varying Bundle Size Reactive Multi-Task Assignment using Selective Cost Estimation for Multi-Agent Systems

Niklas Dahlquist, Shridhar Velhal, George Nikolakopoulos

The paper presents a scalable framework for multi-robot task allocation in complex environments.

View →
cs.AIRecentMay 27, 2026

Do Agents Know What They Can't Do? Evaluating Feasibility Awareness in Tool-Using Agents

Liang Cheng, Mingsheng Cai, Jiuming Jiang, Luo Mai

The paper proposes FeasiGen, a method to automatically create infeasible tasks for tool-using agents, and finds that most current agents struggle significantly to detect and stop when faced with such…

View →
cs.DCcs.SEEmpiricalRecentJul 29, 2026

Hybrid Workflow Composition for Extreme-Scale Data Processing: A Case Study on the HL-LHC (Extended Version)

Alan Malta Rodrigues, Douglas Thain

This paper presents a simulation framework to optimize workflow composition in high-throughput computing environments, demonstrating up to 3.8x throughput increase and a 14.9x reduction in network ove…

View →
cs.DCcs.PFEmpiricalRecentJun 10, 2026

From Fork-Join to Asynchronous Tasks: Parallelizing Tiled Cholesky Decomposition with OpenMP and HPX

Alexander Strack, Alexander Van Craen, Dirk Pflüger

This paper compares the performance of four parallelization variants of the tiled Cholesky decomposition using OpenMP and HPX runtimes.

View →
cs.DMTheoreticalRecentJul 3, 2026

Scheduling Tasks towards Energy Autarky: Benefits and Computational Costs of Flexibility

Robert Bredereck, Till Fluschnik, Klaus Heeger

This paper studies the autarky problem of scheduling energy-consuming jobs with time windows using a battery and an energy forecast, and shows NP-hardness, polynomial-time solvability, and fixed-param…

View →
cs.SEcs.AIcs.MAEmpiricalRecentJul 16, 2026

StructureClaw: Traceable LLM Agents and an Executable Benchmark for Structural Engineering Workflows

Sizhong Qin, Yi Gu, Yao Jiang, Ao Cai +12 more

This paper introduces StructureClaw, an artifact-centered workbench for evaluating structural-engineering agents, and presents StructureClaw-Bench, an executable benchmark for testing these agents.

View →
cs.AIRecentMay 27, 2026

AsyncTool: Evaluating the Asynchronous Function Calling Capability under Multi-Task Scenarios

Kou Shi, Ziao Zhang, Shiting Huang, Avery Nie +6 more

The paper introduces AsyncTool, a new benchmark designed to evaluate LLM agents' ability to handle multiple, concurrent tasks with delayed tool feedback, demonstrating that asynchronous coordination i…

View →
cs.DCEmpiricalRecentJun 11, 2026

Work Stealing for the 2D-Mesh Topology of Satellite Constellations in Low Earth Orbit

Mia Reitz, Dorian Chenet, Jonas Posner

This paper proposes a neighbor-only work stealing strategy for Asynchronous Many-Task runtimes in Space Edge Computing.

View →
cs.AIcs.CLRecentMay 28, 2026

GTA: Generating Long-Horizon Tasks for Web Agents at Scale

Tenghao Huang, Kung-Hsiang Huang, Prafulla Kumar Choubey, Yilun Zhou +3 more

The paper introduces GTA, a scalable framework for generating realistic, multi-hop web-agent tasks with dense, executable trajectories, addressing the current lack of process-level supervision in web…

View →
cs.LGEmpiricalRecentJun 21, 2026

Training-free Task Classification for Multi-Task Model Merging

Jungyong Son, Jinwook Jung, Sungyong Baik

This paper proposes a method called SiM that merges multiple task-specific experts into a single multi-task model without requiring additional training or task-ID-access assumption.

View →
cs.AIRecentMay 27, 2026

A Matter of TASTE: Improving Coverage and Difficulty of Agent Benchmarks

Tomer Keren, Nitay Calderon, Asaf Yehudai, Yotam Perlitz +2 more

The paper introduces TASTE, an automatic task synthesis method that generates challenging agent benchmarks by evolving tool sequences, demonstrating that existing benchmarks are saturated and that TAS…

View →
cs.ROcs.MAEmpiricalRecentOct 20, 2026

Robot-Task Suitability in Heterogeneous Multi-Robot Task Allocation

Daniel Weiner, Raj Korpan

This paper compares ten deterministic and two LLM-based methods for estimating robot suitability for tasks.

View →
cs.CLcs.AIcs.LGRecentMay 28, 2026

Does The Way You Plan Matter? An Empirical Study of Planning Representations for LLM Web Agents

Alejandra Zambrano, Sara Vera Marjanovic, Imene Kerboua, Xing Han Lù +1 more

This paper empirically demonstrates that the choice of plan representation (e.g., checklist vs. narrative) significantly impacts the robustness and success rate of LLM-based web agents.

View →
cs.CLRecentMay 31, 2026

Robust Asynchronous Planning via Auto-Formalization

Jiayi Zhang, Jianing Yin, Ben Zhou, Li Zhang

The paper introduces new benchmarks for complex asynchronous planning and demonstrates that general constraint satisfaction formalizers (like CP-SAT) significantly outperform direct LLM planning or tr…

View →