Sciweavers

3136 search results - page 202 / 628
» Complex networks and evolutionary computation
Sort
View
COMCOM
2000
95views more  COMCOM 2000»
15 years 4 months ago
Protocols and architecture for managing TCP/IP network infrastructures
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...
A. King, R. Hunt
INTERSENSE
2006
ACM
15 years 11 months ago
Addressing network heterogeneity in pervasive application environments
— 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 ...
MOBIHOC
2009
ACM
16 years 5 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
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...
Mathieu Leconte, Jian Ni, Rayadurgam Srikant
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 5 months ago
Algorithms for estimating relative importance in networks
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...
Scott White, Padhraic Smyth
IJCNN
2008
IEEE
15 years 11 months ago
Dynamic logic of phenomena and cognition
—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...
Boris Kovalerchuk, Leonid I. Perlovsky