2 citations · 6 across the 13 of their papers we have counts for
14 papers
Search and Rescue on the Plane
Jared Coleman, Evangelos Kranakis, Danny Krizanc +1
We study a planar variant of the search and rescue problem whereby an agent starting at an arbitrary position in the plane must locate an object at an…
Linear Search with Probabilistic Detection and Variable Speeds
Jared Coleman, Oscar Morales-Ponce
We present results on new variants of the famous linear search (or cow-path) problem that involves an agent searching for a target with unknown position on the infinite line. We co…
Multimodal Search on a Line
Jared Coleman, Dmitry Ivanov, Evangelos Kranakis +2
Inspired by the diverse set of technologies used in underground object detection and imaging, we introduce a novel multimodal linear search problem whereby a single searcher starts…
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…
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…
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…
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…
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…
DARSAN: A Decentralized Review System Suitable for NFT Marketplaces
Sulyab Thottungal Valapu, Tamoghna Sarkar, Jared Coleman +5
We introduce DARSAN, a decentralized review system designed for Non-Fungible Token (NFT) marketplaces, to address the challenge of verifying the quality of highly resalable product…
Line Search for an Oblivious Moving Target
Jared Coleman, Evangelos Kranakis, Danny Krizanc +1
Consider search on an infinite line involving an autonomous robot starting at the origin of the line and an oblivious moving target at initial distance from it. The robo…
Delivery to Safety with Two Cooperating Robots
Jared Coleman, Evangelos Kranakis, Danny Krizanc +1
Two cooperating, autonomous mobile robots with arbitrary nonzero max speeds are placed at arbitrary initial positions in the plane. A remotely detonated bomb is discovered at some…
Message Delivery in the Plane by Robots with Different Speeds
Jared Coleman, Evangelos Kranakis, Danny Krizanc +1
We study a fundamental cooperative message-delivery problem on the plane. Assume robots which can move in any direction, are placed arbitrarily on the plane. Robots each have t…
The Pony Express Communication Problem
Jared Coleman, Evangelos Kranakis, Danny Krizanc +1
We introduce a new problem which we call the Pony Express problem. n robots with differing speeds are situated over some domain. A message is placed at some commonly known point. R…
Minimizing The Maximum Distance Traveled To Form Patterns With Systems of Mobile Robots
Jared Coleman, Evangelos Kranakis, Oscar Morales-Ponce +3
In the pattern formation problem, robots in a system must self-coordinate to form a given pattern, regardless of translation, rotation, uniform-scaling, and/or reflection. In other…