Many routing protocols for wireless sensor network have been proposed, with the purpose of achieving efficient routing. However, when the mobility increases rapidly and the networ...
Yuan Yang, Dong-hyun Lee, Myong-Soon Park, Hoh Pet...
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
In this paper, we present a modular co-synthesis framework called CHARMED that solves the problem of hardware-software co-synthesis of periodic, multi-mode, distributed, embedded ...
Object-oriented programs, when executed, produce a complex webs of objects and references between them, generally referred to as object graphs. These object graphs are difficult t...
As planning agents grow more sophisticated, issues of plan representation arise alongside concerns with plan generation. Planning methods work over increasingly large and difficul...