Local search is widely applied to satisfiable SAT problems, and on some problem classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAlleste...
We propose a novel method for multi-robot plan adaptation which can be used for adapting existing spatial plans of robotic teams to new environments or imitating collaborative spat...
In our prior work, we presented a highly effective local search based heuristic algorithm called the Largest Expanding Sweep Search (LESS) to solve the minimum energy broadcast (M...
The elastic task model proposed by Buttazzo, et. al. [9] is a powerful model for adapting real-time systems in the presence of uncertainty. This paper generalizes the existing ela...
Thidapat Chantem, Xiaobo Sharon Hu, Michael D. Lem...
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...