In this paper, we present an efficient algorithm for performing stepwise selection in the class of decomposable models. We focus on the forward selection procedure, but we also di...
Amol Deshpande, Minos N. Garofalakis, Michael I. J...
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
Abstract—In this paper, we introduce a framework for distributed opportunistic scheduling in multihop wireless ad hoc networks. With the proposed framework, one can take a schedu...
A rising horizon in chip fabrication is the 3D integration technology. It stacks two or more dies vertically with a dense, high-speed interface to increase the device density and ...
Xiuyi Zhou, Yi Xu, Yu Du, Youtao Zhang, Jun Yang 0...
Abstract—Recently packet scheduling algorithms such as Packetized GPS (PGPS), Worst-case Fair Weighted Fair Queueing (WF2 Q) and Self-Clocked Fair Queueing (SCFQ) have been propo...