We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...
Ioannis Tsamardinos, Laura E. Brown, Constantin F....
In this paper, we consider a class of energy-aware routing algorithm that explicitly takes into account the connectivity of the remaining sensor network. In typical sensor network ...
One of the important issues in the design of future generation high-speed networks is to provide differentiated services to different types of applications with various time const...
: Recently, researchers have discovered that many of social, natural and biological networks are characterized by scale-free powerlaw connectivity distribution and a few densely po...
—Much research has been devoted to maximize the life time of mobile ad-hoc networks. Life time has often been defined as the time elapsed until the first node is out of battery...