We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
Michael L. Littman, Judy Goldsmith, Martin Mundhen...
—We show that deadlocks due to dependencies on consumption channels are a fundamental problem in wormhole multicast routing. This type of resource deadlocks has not been addresse...
Rajendra V. Boppana, Suresh Chalasani, C. S. Ragha...
Abstract— A dual rate synchronous DS/CDMA system provides service to low bit rate and high bit rate users. In a fixed duration interval, a low rate user transmits one bit while ...
Mohammad Saquib, Roy D. Yates, Narayan B. Mandayam
The aim of our work is to be able to do fully formal, machine verified proofs over Generic Haskellstyle polytypic programs. In order to achieve this goal, we embed polytypic prog...
: The promise of smart buildings (SBs) is a safer more productive environment for users and a more operationally efficient building for owners. The automation of building function ...
Kris McGlinn, Eleanor O'Neill, Alan Gibney, Declan...