2007 | ||
---|---|---|
11 | EE | Stephen M. Majercik: APPSSAT: Approximate probabilistic planning using stochastic satisfiability. Int. J. Approx. Reasoning 45(2): 402-419 (2007) |
2005 | ||
10 | Stephen M. Majercik, Byron Boots: DC-SSAT: A Divide-and-Conquer Approach to Solving Stochastic Satisfiability Problems Efficiently. AAAI 2005: 416-422 | |
9 | EE | Stephen M. Majercik: APPSSAT: Approximate Probabilistic Planning Using Stochastic Satisfiability. ECSQARU 2005: 209-220 |
2004 | ||
8 | EE | Stephen M. Majercik: Nonchronological Backtracking in Stochastic Boolean Satisfiability. ICTAI 2004: 498-507 |
2003 | ||
7 | EE | Stephen M. Majercik, Michael L. Littman: Contingent planning under uncertainty via stochastic satisfiability. Artif. Intell. 147(1-2): 119-162 (2003) |
2002 | ||
6 | Stephen M. Majercik, Andrew P. Rusczek: Faster Probabilistic Planning through More Efficient Stochastic Satisfiability Problem Encodings. AIPS 2002: 163-172 | |
2001 | ||
5 | Michael L. Littman, Stephen M. Majercik, Toniann Pitassi: Stochastic Boolean Satisfiability. J. Autom. Reasoning 27(3): 251-296 (2001) | |
1999 | ||
4 | Stephen M. Majercik, Michael L. Littman: Contingent Planning Under Uncertainty via Stochastic Satisfiability. AAAI/IAAI 1999: 549-556 | |
3 | Stephen M. Majercik: Planning Under Uncertainty via Stochastic Statisfiability. AAAI/IAAI 1999: 950 | |
1998 | ||
2 | Stephen M. Majercik, Michael L. Littman: Using Caching to Solve Larger Probabilistic Planning Problems. AAAI/IAAI 1998: 954-959 | |
1 | Stephen M. Majercik, Michael L. Littman: MAXPLAN: A New Approach to Probabilistic Planning. AIPS 1998: 86-93 |
1 | Byron Boots | [10] |
2 | Michael L. Littman | [1] [2] [4] [5] [7] |
3 | Toniann Pitassi | [5] |
4 | Andrew P. Rusczek | [6] |