Conference paper
Automatic taxonomy generation: Issues and possibilities
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
A digital communication network can be modeled as an adversarial queueing network. An adversarial queueing network is defined to be stable if the number of packets stays bounded over time. A central question is to determine which adversarial queueing networks are stable under-every work-conserving packet routing policy. Our main result is that stability of an adversarial queueing network is implied by stability of an associated fluid queueing network.
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev