Shlomo Zilberstein | |
|---|---|
 Zilberstein | |
| Lahir | 1960 (umur 65–66) Tel Aviv, Israel |
| Almamater | |
| Karier ilmiah | |
| Bidang | |
| Tempat kerja | University of Massachusetts, Amherst |
| Disertasi | Operational Rationality Through Compilation of Anytime Algorithms (1993) |
| Stuart J. Russell | |
| Situs web | www.cs.umass.edu/~shlomo/ |
Shlomo Zilberstein (Ibrani: שלמה זילברשטיין; kelahiran 1960) adalah seorang ilmuwan komputer Israel-Amerika. Ia adalah Professor of Computer Science and Associate Dean for Research and Engagement in the College of Information and Computer Sciences di Universitas Massachusetts, Amherst.[1] Ia lulus dengan gelar B.A. dalam ilmu komputer summa cum laude dari Technion – Institut Teknologi Israel pada 1982, dan menerima gelar Ph.D. dalam ilmu komputer dari University of California at Berkeley pada 1993, dengan dibimbing oleh Stuart J. Russell.[2][3]
Publikasi pilihan
- Srivastava, Siddharth; Immerman, Neil; Zilberstein, Shlomo (2012). "Applicability Conditions for Plans with Loops: Computability Results and Algorithms" (PDF). Artificial Intelligence. 191 (1–2): 1–19. doi:10.1016/j.artint.2012.07.005.
- Amato, Christopher; Bernstein, Daniel S.; Zilberstein, Shlomo (2010). "Optimizing Fixed-Size Stochastic Controllers for POMDPs and Decentralized POMDPs" (PDF). Autonomous Agents and Multi-Agent Systems. 21 (3): 293–320. doi:10.1007/s10458-009-9103-z. S2CID 12915662.
- Seuken, Sven; Zilberstein, Shlomo (2008). "Formal Models and Algorithms for Decentralized Decision Making under Uncertainty" (PDF). Autonomous Agents and Multi-Agent Systems. 17 (1): 190–250. doi:10.1007/s10458-007-9026-5. S2CID 12707282.
- Goldman, Claudia V.; Zilberstein, Shlomo (2004). "Decentralized Control of Cooperative Systems: Categorization and Complexity Analysis" (PDF). Journal of Artificial Intelligence Research. 22: 143–174. doi:10.1613/jair.1427.
- Hansen, Eric A.; Bernstein, Daniel S.; Zilberstein, Shlomo (2004). "Dynamic Programming for Partially Observable Stochastic Games" (PDF). Proceedings of the 19th National Conference on Artificial Intelligence. AAAI. hlm. 709–715.
- Bernstein, Daniel S.; Givan, Robert; Immerman, Neil; Zilberstein, Shlomo (2002). "The Complexity of Decentralized Control of Markov Decision Processes" (PDF). Mathematics of Operations Research. 27 (4): 819–840. arXiv:1301.3836. doi:10.1287/moor.27.4.819.297. S2CID 1195261.
- Hansen, Eric A.; Zilberstein, Shlomo (2001). "LAO*: A Heuristic Search Algorithm that Finds Solutions with Loops" (PDF). Artificial Intelligence. 129 (1–2): 35–62. doi:10.1016/s0004-3702(01)00106-0.
- Hansen, Eric A.; Zilberstein, Shlomo (2001). "Monitoring and control of anytime algorithms: A dynamic programming approach" (PDF). Artificial Intelligence. 126 (1–2): 139–157. doi:10.1016/S0004-3702(00)00068-0.
- Zilberstein, Shlomo (1996). "Using Anytime Algorithms in Intelligent Systems" (PDF). AI Magazine. 17 (3): 73–83.
- Zilberstein, Shlomo; Russell, Stuart J. (1996). "Optimal Composition of Real-Time Systems" (PDF). Artificial Intelligence. 82 (1–2): 1–19. doi:10.1016/0004-3702(94)00074-3.
Referensi
Pranala luar
- Dr. Zilberstein's Academic Website
- Resource-Bounded Reasoning Laboratory website
- Decentralized Partially Observable Markov Decision Process (Dec-POMDP) overview, description, and publications within the field
Basis data pengawasan otoritas: Akademik  |
|---|
