2473 search results - page 179 / 495 » The Logic of Communication Graphs |
157
Voted
HIPEAC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Stream programming is a promising way to expose concurrency to the compiler. A stream program is built from kernels that communicate only via point-to-point streams. The ...
142
Voted
PODC
2006
ACM
15 years 9 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
114
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
We explore the problem of modeling Internet connectivity at the Autonomous System (AS) level and present an economically-principled dynamic model that reproduces key features of t...
160
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
151
Voted
MOBISYS
2004
ACM
16 years 3 months ago
2004
ACM
The 802.11 IEEE Standard has enabled low cost and effective wireless LAN services (WLAN). With the sales and deployment of WLAN based networks exploding, many people believe that ...