Sciweavers

8663 search results - page 1573 / 1733
» 10 papers on network models
Sort
View
MPC
2010
Springer
152views Mathematics» more  MPC 2010»
15 years 11 months ago
Lucy-n: a n-Synchronous Extension of Lustre
Synchronous functional languages such as Lustre or Lucid Synchrone define a restricted class of Kahn Process Networks which can be executed with no buffer. Every expression is as...
Louis Mandel, Florence Plateau, Marc Pouzet
QOFIS
2001
Springer
15 years 11 months ago
Constrained TCP-Friendly Congestion Control for Multimedia Communication
With the lack of admission control and resource reservation mechanisms in the Internet, overload situations can only be avoided by having the end systems deploying congestion cont...
Dorgham Sisalem, Adam Wolisz
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
15 years 10 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
COMPSAC
1998
IEEE
15 years 10 months ago
Allocating Data Objects to Multiple Sites for Fast Browsing of Hypermedia Documents
Many world wide web applications require access, transfer, and synchronization of large multimedia data objects (MDOs) (such as, audio, video, and images) across the communication...
Siu-Kai So, Ishfaq Ahmad, Kamalakar Karlapalem
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 10 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
« Prev « First page 1573 / 1733 Last » Next »