 | SIAM Activity Group on Discrete Mathematics - 2001 - 962 lapas
...Matousek. On linear-time deterministic algorithms for optimization problems in fixed dimension. In SODA: ACM-SIAM Symposium on Discrete Algorithms (A...and Experimental Analysis of Discrete Algorithms), 1993. [6] V. Chvátal. Linear Programming. WH Freeman and Company, New York, 1983. [7] KL Clarkson.... | |
 | Hemant K. Bhargava, Nong Ye - 2002 - 342 lapas
...penalty. References Azar, Y., Naor, J., and Rom, R. (1992). The competitiveness of on-line assignments. In SODA: ACM-SIAM Symposium on Discrete Algorithms (A...and Experimental Analysis of Discrete Algorithms). Baker, KR (1992). Element of Sequencing and Scheduling. Dartmouth Collage. Bertsekas, DP, Pallottino,... | |
 | Peter Wayner - 2002 - 444 lapas
...August 2000. Wright and Spalding. Experimental performance of shared RSA modulus generation (short). In SODA: ACM-SIAM Symposium on Discrete Algorithms (A...and Experimental Analysis of Discrete Algorithms), 1999. X.-G. Xia, C. Boncelet, and G. Arce. A multiresolution watermark for digital images. In IEEE... | |
 | Y.N. Srikant, Priti Shankar - 2002 - 930 lapas
...Benjamin/Cummings, Redwood City, CA, 1995. [35] Farach and Liberatore, On Local Register Allocation, SODA: ACM-SIAM Symposium on Discrete Algorithms (A...and Experimental Analysis of Discrete Algorithms), 1998. [36] S. Freudenberger and J. Ruttenberg, Phase ordering of register allocation and instruction... | |
 | Joseph Y-T. Leung - 2004 - 1224 lapas
...511-527. [38] B. Kalyanasundaram and K. Pruhs, Eliminating migration in multi-processor scheduling, SODA: ACM-SIAM Symposium on Discrete Algorithms (A...and Experimental Analysis of Discrete Algorithms), 1999. [39] GC Buttazzo, Hard real-time computing systems, predictable scheduling algorithms and applications,... | |
 | Bruno Durand - 2006 - 730 lapas
...Chekuri, and Motwani. Fast estimation of diameter and shortest paths (without matrix multiplication). In SODA: ACM-SIAM Symposium on Discrete Algorithms (A...and Experimental Analysis of Discrete Algorithms), 1996. [2] R. Balzer. An 8-state minimal time solution to the firing squad synchronization problem.... | |
 | Jean-Marc Pierson - 2005 - 151 lapas
...USENIX Symposium on Internet Technologies and Systems. (1997) 8. Young, N.: On-line file caching. In: SODA: ACM-SIAM Symposium on Discrete Algorithms (A...and Experimental Analysis of Discrete Algorithms). (1998) 9. Otoo, EJ, Rotem, D., Shoshani, A.: Impact of admission and cache replacement policies on... | |
 | Sebastian Engell - 2008 - 308 lapas
...B., Goldberg, A. and Radzik, T. (1994) Shortest paths algorithms: Theory and experimental evaluation. SODA: ACM-SIAM Symposium on Discrete Algorithms (A...and Experimental Analysis of Discrete Algorithms). 20 Cook, W., Cunningham, W., Pulleyblank, W. and Schrijver, A. (1998) Combinatorial Optimization. WileyInterscience... | |
| |
In: SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms). 