paper-with-me

Papers

To Schedule or not to Schedule: Extracting Task Specific Temporal Entities and Associated Negation Constraints

2020-11-15 · EMNLP 2020 11 · Barun Patra, Chala Fufa, Pamela Bhattacharya, Charles Lee

State of the art research for date-time entity extraction from text is task agnostic. Consequently, while the methods proposed in literature perform well for generic date-time extraction from texts, they don't fare as well on task specific date-time entity extraction where only a subset of the date-time entities present in the text are pertinent to solving the task. Furthermore, some tasks require identifying negation constraints associated with the date-time entities to correctly reason over time. We showcase a novel model for extracting task-specific date-time entities along with their negation constraints. We show the efficacy of our method on the task of date-time understanding in the context of scheduling meetings for an email-based digital AI scheduling assistant. Our method achieves an absolute gain of 19\% f-score points compared to baseline methods in detecting the date-time entities relevant to scheduling meetings and a 4\% improvement over baseline methods for detecting negation constraints over date-time entities.

📄 PDF Abstract BibTeX arXiv:2012.02594

Code (0)

등록된 구현이 없습니다.

Tasks

NegationScheduling

Similar Papers 제목 키워드 기반

ScheduleStream: Temporal Planning with Samplers for GPU-Accelerated Multi-Arm Task and Motion Planning & Scheduling

2025-11-06 · Caelan Garrett, Fabio Ramos arxiv

Bimanual and humanoid robots are appealing because of their human-like ability to leverage multiple arms to efficiently complete tasks. However, controlling multiple arms at once is computationally challenging due to the…

Motion Planning

ScheduleNet: Learn to solve multi-agent scheduling problems with reinforcement learning

2021-06-06 · Junyoung Park, Sanjar Bakhtiyar, Jinkyoo Park

We propose ScheduleNet, a RL-based real-time scheduler, that can solve various types of multi-agent scheduling problems. We formulate these problems as a semi-MDP with episodic reward (makespan) and learn ScheduleNet, a …

Decision MakingGraph AttentionJob Shop Schedulingreinforcement-learning+2

Planning, Scheduling, and Uncertainty in the Sequence of Future Events

2013-03-27 · B. R. Fox, Karl G. Kempf

Scheduling in the factory setting is compounded by computational complexity and temporal uncertainty. Together, these two factors guarantee that the process of constructing an optimal schedule will be costly and the chan…

Scheduling

AsyncDSB: Schedule-Asynchronous Diffusion Schrödinger Bridge for Image Inpainting

2024-12-11 · Zihao Han, Baoquan Zhang, Lisai Zhang, Shanshan Feng 외

Image inpainting is an important image generation task, which aims to restore corrupted image from partial visible area. Recently, diffusion Schr\"odinger bridge methods effectively tackle this task by modeling the trans…

Image GenerationImage InpaintingScheduling

Scheduling Plans of Tasks

2021-02-06 · Davide Andrea Guastella

We present a heuristic algorithm for solving the problem of scheduling plans of tasks. The plans are ordered vectors of tasks, and tasks are basic operations carried out by resources. Plans are tied by temporal, preceden…

Scheduling