AAAAAA
Results:
1-9
|
Results: 9
Authors:
Awerbuch, B
Azar, Y
Regev, O
Citation: B. Awerbuch et al., Maximizing job benefits on-line, J SCHED, 4(6), 2001, pp. 287-296
Authors:
Awerbuch, B
Shavitt, Y
Citation: B. Awerbuch et Y. Shavitt, Topology aggregation for directed graphs, IEEE ACM TN, 9(1), 2001, pp. 82-90
Authors:
Andrews, M
Awerbuch, B
Fernandez, A
Leighton, T
Liu, ZY
Kleinberg, J
Citation: M. Andrews et al., Universal-stability results and performance bounds for greedy contention-resolution protocols, J ACM, 48(1), 2001, pp. 39-69
Authors:
Awerbuch, B
Azar, Y
Fiat, A
Leonardi, S
Rosen, A
Citation: B. Awerbuch et al., On-line competitive algorithms for call admission in optical networks, ALGORITHMIC, 31(1), 2001, pp. 29-43
Authors:
Awerbuch, B
Azar, Y
Plotkin, S
Waarts, O
Citation: B. Awerbuch et al., Competitive routing of virtual circuits with unknown duration, J COMPUT SY, 62(3), 2001, pp. 385-397
Authors:
Amir, Y
Awerbuch, B
Barak, A
Borgstrom, RS
Keren, A
Citation: Y. Amir et al., An opportunity cost approach for job assignment in a scalable computing cluster, IEEE PARALL, 11(7), 2000, pp. 760-768
Authors:
Amir, Y
Awerbuch, B
Borgstrom, RS
Citation: Y. Amir et al., A cost-benefit framework for online management of a metacomputing system, DECIS SUP S, 28(1-2), 2000, pp. 155-164
Authors:
Awerbuch, B
Du, Y
Shavitt, Y
Citation: B. Awerbuch et al., The effect of network hierarchy structure on performance of ATM PNNI hierarchical routing, COMPUT COMM, 23(10), 2000, pp. 980-986
Authors:
Awerbuch, B
Betke, M
Rivest, RL
Singh, M
Citation: B. Awerbuch et al., Piecemeal graph exploration by a mobile robot, INF COMPUT, 152(2), 1999, pp. 155-172
Risultati:
1-9
|