6480 search results - page 324 / 1296 » Proximity Communication and Time |
148
click to vote
ACNS
2005
Springer
16 years 11 days ago
2005
Springer
k-times anonymous authentication (k-TAA) schemes allow members of a group to be anonymously authenticated by application providers for a bounded number of times. k-TAA has applicat...
193
click to vote
SAC
2003
ACM
16 years 2 days ago
2003
ACM
We present a distributed framework that enables real-time streaming and visualization of data generated by large remote simulations. We address issues arising from distributed cli...
164
click to vote
GD
2003
Springer
16 years 1 days 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 ...
180
click to vote
PARELEC
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we investigate the worst case performance of Earliest Due Date algorithm when applied to packet scheduling in distributed systems. We assume that the processing ele...
172
click to vote
KI
2001
Springer
15 years 11 months ago
2001
Springer
Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respe...