Sciweavers

6229 search results - page 996 / 1246
» Models of Computation for Networks on Chip
Sort
View
100
Voted
SASO
2007
IEEE
15 years 6 months ago
Desynchronization: The Theory of Self-Organizing Algorithms for Round-Robin Scheduling
The study of synchronization has received much attention in a variety of applications, ranging from coordinating sensors in wireless networks to models of fireflies flashing in...
Ankit Patel, Julius Degesys, Radhika Nagpal
WINE
2007
Springer
120views Economy» more  WINE 2007»
15 years 6 months ago
Public Advertisement Broker Markets
Motivated by the growth of various networked systems as potential market places, we study market models wherein, owing to the size of the markets, transactions take place between l...
Atish Das Sarma, Deeparnab Chakrabarty, Sreenivas ...
WIOPT
2006
IEEE
15 years 6 months ago
Flow-level stability of channel-aware scheduling algorithms
— Channel-aware scheduling strategies provide an effective mechanism for improving the throughput performance in wireless data networks by exploiting channel fluctuations. The p...
Sem C. Borst, Matthieu Jonckheere
INFOSCALE
2006
ACM
15 years 6 months ago
PENS: an algorithm for density-based clustering in peer-to-peer systems
Huge amounts of data are available in large-scale networks of autonomous data sources dispersed over a wide area. Data mining is an essential technology for obtaining hidden and v...
Mei Li, Guanling Lee, Wang-Chien Lee, Anand Sivasu...
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 6 months ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden