- Email: [email protected]
Author Index—Volume 126 (2001)
Artificial Intelligence 126 (2001) 201
Author Index—Volume 126 (2001)
Darwiche, A. Recursive conditioning Finkelstein, L. and S. Markovitch Optimal schedules for monitoring anytime algorithms Gomes, C.P. and B. Selman Algorithm portfolios Hansen, E.A. and S. Zilberstein Monitoring and control of anytime algorithms: A dynamic programming approach Horvitz, E. Principles and applications of continual computation Horvitz, E. and S. Zilberstein Computational tradeoffs under bounded resources Markovitch, S., see Finkelstein, L. Selman, B., see Gomes, C.P. Zhang, W. Iterative state-space reduction for flexible computation Zilberstein, S., see Hansen, E.A. Zilberstein, S., see Horvitz, E.
0004-3702/01/$ – see front matter PII: S 0 0 0 4 - 3 7 0 2 ( 0 1 ) 0 0 0 5 7 - 1
5 – 41 63– 108 43– 62
139– 157 159– 196 1– 4 63– 108 43– 62 109– 138 139– 157 1– 4
Author Index—Volume 126 (2001)
Darwiche, A. Recursive conditioning Finkelstein, L. and S. Markovitch Optimal schedules for monitoring anytime algorithms Gomes, C.P. and B. Selman Algorithm portfolios Hansen, E.A. and S. Zilberstein Monitoring and control of anytime algorithms: A dynamic programming approach Horvitz, E. Principles and applications of continual computation Horvitz, E. and S. Zilberstein Computational tradeoffs under bounded resources Markovitch, S., see Finkelstein, L. Selman, B., see Gomes, C.P. Zhang, W. Iterative state-space reduction for flexible computation Zilberstein, S., see Hansen, E.A. Zilberstein, S., see Horvitz, E.
0004-3702/01/$ – see front matter PII: S 0 0 0 4 - 3 7 0 2 ( 0 1 ) 0 0 0 5 7 - 1
5 – 41 63– 108 43– 62
139– 157 159– 196 1– 4 63– 108 43– 62 109– 138 139– 157 1– 4