With their increased power and versatility, today's computer networks are becoming used for an ever-growing number of diverse applications. Further, the networking structures...
— Pervasive computing applications typically involve rich interactions and heterogeneous network types; e.g. involving the collation of data from a sensor network into a replicat...
Paul Grace, Geoff Coulson, Gordon S. Blair, Barry ...
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
—Modeling of complex phenomena such as the mind presents tremendous computational complexity challenges. The neural modeling fields theory (NMF) addresses these challenges in a n...