In this paper, we describe methods for e ciently computing better solutions to control problems in continuous state spaces. We provide algorithms that exploit online search to boo...
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
We present a general framework for reasoning about network worms and analyzing the potency of worms within a specific network. First, we present a discussion of the life cycle of ...
IAPR Workshop on Machine Vision and Applications, pp. 455-458, 2000, Tokyo, Japan In this paper, we integrate the model-based tracking and local contexture (temporal and spatial) ...
Mobile ad hoc wireless networks are generating novel interests in mobile computing. The dynamism in network topology has thrown up multifarious issues, requiring a fresh look into ...
Krishna Paul, Romit Roy Choudhury, Somprakash Band...