activity
20202026
most citedLine Search for an Oblivious Moving Target

2 citations · 6 across the 13 of their papers we have counts for

collaborators
Showing 2024Show all

5 papers · 1 filter

cs.CL2024

LLM-Assisted Rule Based Machine Translation for Low/No-Resource Languages

Jared Coleman, Bhaskar Krishnamachari, Khalil Iskarous +1

We propose a new paradigm for machine translation that is particularly useful for no-resource languages (those without any publicly available bilingual or monolingual corpora): LLM…

cs.DM2024

Optimal Delivery with a Faulty Drone

Jared Coleman, Danny Krizanc, Evangelos Kranakis +1

We introduce and study a new cooperative delivery problem inspired by drone-assisted package delivery. We consider a scenario where a drone, en route to deliver a package to a dest…

cs.DM2024

Linear Search for an Escaping Target with Unknown Speed

Jared Coleman, Dmitry Ivanov, Evangelos Kranakis +2

We consider linear search for an escaping target whose speed and initial position are unknown to the searcher. A searcher (an autonomous mobile agent) is initially placed at the or…

cs.DC2024★ 1 cited

Parameterized Task Graph Scheduling Algorithm for Comparing Algorithmic Components

Jared Coleman, Ravi Vivek Agrawal, Ebrahim Hirani +1

Scheduling distributed applications modeled as directed, acyclic task graphs to run on heterogeneous compute networks is a fundamental (NP-Hard) problem in distributed computing fo…

cs.DC2024

PISA: An Adversarial Approach To Comparing Task Graph Scheduling Algorithms

Jared Coleman, Bhaskar Krishnamachari

Scheduling a task graph representing an application over a heterogeneous network of computers is a fundamental problem in distributed computing. It is known to be not only NP-hard…