2693 search results - page 194 / 539 » French Order Without Order |
128
click to vote
CCS
2004
ACM
15 years 9 months ago
2004
ACM
d Abstract) XiaoFeng Wang∗ Michael K. Reiter† We present congestion puzzles (CP), a new countermeasure to bandwidth-exhaustion attacks. Like other defenses based on client puz...
125
click to vote
GD
2003
Springer
15 years 9 months ago
2003
Springer
A graph with an ordered k-partition of the vertices is radial level planar if there is a strictly outward drawing on k concentric levels without crossings. Radial level planarity ...
137
click to vote
HIPC
2003
Springer
15 years 9 months ago
2003
Springer
Many complex real-time applications involve combined scheduling of hard and soft real-time tasks. In this paper, we propose a combined scheduling algorithm, called Emergency Algori...
163
click to vote
SAC
2000
ACM
15 years 8 months ago
2000
ACM
Linda is a high level communication model which allows agents to communicate via a shared tuple spaces without knowing each other’s identities and without having to arrange for ...
122
click to vote
SIGCOMM
1997
ACM
15 years 8 months ago
1997
ACM
— Measurement-based admission control (MBAC) is an attractive mechanism to concurrently offer quality of service (QoS) to users, without requiring a priori traffic specificatio...