Sciweavers

8437 search results - page 1398 / 1688
» Preferences over Sets
Sort
View
ICNP
1997
IEEE
15 years 11 months ago
Balanced Routing
Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inh...
Jorge Arturo Cobb, Mohamed G. Gouda
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
15 years 11 months ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
EUROPAR
1997
Springer
15 years 11 months ago
Modulo Scheduling with Cache Reuse Information
Instruction scheduling in general, and software pipelining in particular face the di cult task of scheduling operations in the presence of uncertain latencies. The largest contrib...
Chen Ding, Steve Carr, Philip H. Sweany
NGITS
1997
Springer
15 years 11 months ago
Faster Joins, Self Joins and Multi-Way Joins Using Join Indices
We propose a new algorithm, called Stripe-join, for performing a join given a join index. Stripe-join is inspired by an algorithm called \Jive-join" developed by Li and Ross....
Hui Lei, Kenneth A. Ross
GROUP
1993
ACM
15 years 10 months ago
ASCW: an assistant for cooperative work
The Assistant for Cooperative Work (ASCW) is a powerful system for the management of distributed work. It consists of the Task Manager, the organizational information system TOSCA...
Thomas Kreifelts, Wolfgang Prinz
« Prev « First page 1398 / 1688 Last » Next »