Papers with scheduling
Dynamic Fusion Network for Multi-Domain End-to-end Task-Oriented Dialog (2020.acl-main)
Copied to clipboard
| Challenge: | Recent studies show remarkable success in end-to-end task-oriented dialog systems . however, most models rely on large training data, which is difficult to scalable for new domains with limited labeled data. |
| Approach: | They propose a shared-private network which exploits the relevance between the target domain and each domain. |
| Outcome: | The proposed model outperforms existing methods on multi-domain dialogue by 13.9% on average. |
To Schedule or not to Schedule: Extracting Task Specific Temporal Entities and Associated Negation Constraints (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing models for date-time entity extraction from text are task agnostic, resulting in insufficient results for task specific date-timing extraction. |
| Approach: | They propose a model for extracting subset of date-time entities from text and their negation constraints. |
| Outcome: | The proposed model achieves an absolute gain of 19% f-score points compared to baseline methods in detecting date-time entities relevant to scheduling meetings and a 4% improvement over baseline methods for detecting negation constraints over date-timing entities. |
Feasible is Not Enough: Cost-Aware Optimal Tool-Chain Planning on Multi-Solution Tool Graphs (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing tools and benchmarks often form tool learning (TL) as a single-solution setting . exploring large-scale TG is computationally expensive, especially under constrained context budgets. |
| Approach: | They propose a framework for learning optimal TL policies over large tool graphs . they train a reinforcement learning agent to acquire transferable expansion skills . |
| Outcome: | The proposed framework improves task success and solution optimality by 46.21% and 66.34% on multiSoTLBench. |
Learning to Reason Over Time: Timeline Self-Reflection for Improved Temporal Reasoning in Language Models (2025.acl-long)
Copied to clipboard
| Challenge: | Large Language Models struggle with temporal reasoning, which requires processing time-related information such as event sequencing, durations, and inter-temporal relationships. |
| Approach: | They propose a framework that enhances the temporal reasoning abilities of Large Language Models (LLMs) by combining timeline construction with iterative self-reflection. |
| Outcome: | The proposed framework improves the temporal reasoning abilities of large language models and improves traceability of the inference process. |
From Language to Driving: A Dual-Loop SLM-Enhanced Framework for Multi-Planner Scheduling via a Domain-Specific Language (2026.acl-long)
Copied to clipboard
Jiawei Liu, Xun Gong, Muli Yang, Xingrui Yu, Fen Fang, Xulei Yang, Ivor Tsang, Yunfeng hu, Hong Chen, Qing Guo
| Challenge: | Recent large language model-based AD research offers new avenues to address this challenge. |
| Approach: | They propose a small language model (SLM) for high-level semantic reasoning and schedule generation, while an inner loop performs low-level, high-frequency schedule execution and vehicle control. |
| Outcome: | The proposed framework improves instruction completion rates while maintaining high safety and compliance relative to multiple baselines. |
TPS-Bench: Evaluating AI Agents’ Tool Planning & Scheduling Abilities in Compounding Tasks (2026.acl-long)
Copied to clipboard
| Challenge: | Large language model (LLM) agents have demonstrated strong problem-solving competence across domains like research and coding. |
| Approach: | They propose to use a tool repository to analyze the ability of large language model agents to solve complex problems. |
| Outcome: | The proposed model outperforms open-source and closed-source models in task completion rate and efficiency. |
EquiBench: Benchmarking Large Language Models’ Reasoning about Program Semantics via Equivalence Checking (2025.emnlp-main)
Copied to clipboard
Anjiang Wei, Jiannan Cao, Ran Li, Hongyu Chen, Yuhui Zhang, Ziheng Wang, Yuan Liu, Thiago S. F. X. Teixeira, Diyi Yang, Ke Wang, Alex Aiken
| Challenge: | EquiBench is a new benchmark to evaluate large language models' ability to reason about program semantics . Unlike natural language, code is executable. |
| Approach: | They propose a benchmark to evaluate large language models through equivalence checking . EquiBench consists of 2400 program pairs across four languages and six categories . |
| Outcome: | The proposed benchmark consists of 2400 program pairs across four languages and six categories. |