Judy Goldsmith

Christopher Lusena, Tong Li, Shelia Sittinger, Chris Wells, Judy Goldsmith: My Brain is Full: When More Memory Helps. CoRR abs/1301.6715 (2013)

Judy Goldsmith, Michael L. Littman, Martin Mundhenk: The Complexity of Plan Existence and Evaluation in Probabilistic Domains. CoRR abs/1302.1540 (2013)

Nicholas Mattei, Judy Goldsmith, Andrew Klapper: On the Complexity of Bribery and Manipulation in Tournaments with Uncertain Information. FLAIRS Conference 2012

Rebecca Bates, Judy Goldsmith, Rosalyn Berne, Valerie Summet, Nanette Veilleux: Science fiction in computer science education. SIGCSE 2012: 161-162

Peng Dai, Mausam, Daniel S. Weld, Judy Goldsmith: Topological Value Iteration Algorithms. J. Artif. Intell. Res. (JAIR) 42: 181-209 (2011)

Thomas Dodson, Nicholas Mattei, Judy Goldsmith: A Natural Language Argumentation Interface for Explanation Generation in Markov Decision Processes. ADT 2011: 42-55

Thomas Dodson, Nicholas Mattei, Judy Goldsmith: A Natural Language Argumentation Interface for Explanation Generation in Markov Decision Processes. ExaCt 2011: 1-10

Judy Goldsmith, Christopher Lusena, Martin Mundhenk: Nonapproximability Results for Partially Observable Markov Decision Processes. CoRR abs/1106.0242 (2011)

Peng Dai, Judy Goldsmith: Ranking policies in discrete Markov decision processes. Ann. Math. Artif. Intell. 59(1): 107-123 (2010)

Judy Goldsmith, Kathryn B. Laskey: Introduction to the special issue on Bayesian model views. Int. J. Approx. Reasoning 51(2): 165-166 (2010)

Liangrong Yi, Judy Goldsmith: Decision-theoretic harmony: A first step. Int. J. Approx. Reasoning 51(2): 263-274 (2010)

Alex Dekhtyar, Judy Goldsmith, Beth Goldstein, Krol Kevin Mathias, Cynthia Isenhour: Planning for success: The interdisciplinary approach to building Bayesian models. Int. J. Approx. Reasoning 50(3): 416-428 (2009)

Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe: The Complexity of Probabilistic Lobbying. ADT 2009: 86-97

Peng Dai, Judy Goldsmith: Finding Best k Policies. ADT 2009: 144-155

John Mark Agosta, Russell Almond, Dennis M. Buede, Marek J. Druzdzel, Judy Goldsmith, Silja Renooij: Workshop summary: Seventh annual workshop on Bayes applications. ICML 2009: 163

Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe: The Complexity of Probabilistic Lobbying. CoRR abs/0906.4431 (2009)

Judy Goldsmith, Ulrich Junker: Preference Handling for Artificial Intelligence. AI Magazine 29(4): 9-12 (2008)

Judy Goldsmith, Matthias Hagen, Martin Mundhenk: Complexity of DNF minimization and isomorphism testing for monotone formulas. Inf. Comput. 206(6): 760-775 (2008)

Judy Goldsmith, Jérôme Lang, Miroslaw Truszczynski, Nic Wilson: The Computational Complexity of Dominance and Consistency in CP-Nets. J. Artif. Intell. Res. (JAIR) 33: 403-432 (2008)

Peng Dai, Alexander L. Strehl, Judy Goldsmith: Expediting RL by using graphical structures. AAMAS (3) 2008: 1325-1328

David Krieg, Patricia Jacovino, Judy Goldsmith, Beth Goldstein: A bottom-up approach to welfare case management decision support software. DG.O 2008: 397-398

Liangrong Yi, Raphael A. Finkel, Judy Goldsmith: Planning for Welfare to Work. FLAIRS Conference 2008: 696-701

Sarabjot Singh Anand, Daniel Bahls, Catherina Burghart, Mark H. Burstein, Huajun Chen, John Collins, Thomas G. Dietterich, Jon Doyle, Chris Drummond, William Elazmeh, Christopher W. Geib, Judy Goldsmith, Hans W. Guesgen, Jim Hendler, Dietmar Jannach, Nathalie Japkowicz, Ulrich Junker, Gal A. Kaminka, Alfred Kobsa, Jérôme Lang, David B. Leake, Lundy Lewis, Gerard Ligozat, Sofus A. Macskassy, Drew V. McDermott, Ted Metzler, Bamshad Mobasher, Ullas Nambiar, Zaiqing Nie, Klas Orsvärn, Barry O'Sullivan, David V. Pynadath, Jochen Renz, Rita V. Rodríguez, Thomas Roth-Berghofer, Stefan Schulz, Rudi Studer, Yimin Wang, Michael P. Wellman: AAAI-07 Workshop Reports. AI Magazine 28(4): 119-128 (2007)

Peng Dai, Judy Goldsmith: Multi-Threaded BLAO* Algorithm. FLAIRS Conference 2007: 56-61

Peng Dai, Judy Goldsmith: Topological Value Iteration Algorithm for Markov Decision Processes. IJCAI 2007: 1860-1865

Judy Goldsmith, Martin Mundhenk: Competition Adds Complexity. NIPS 2007

Liangrong Yi, Judy Goldsmith: Automatic Generation of Four-part Harmony. BMA 2007

Kathryn B. Laskey, Suzanne M. Mahoney, Judy Goldsmith (Eds.): Proceedings of the Fifth UAI Bayesian Modeling Applications Workshop (UAI-AW 2007), Vancouver, British Columbia, Canada, July 19, 2007. CEUR Workshop Proceedings 268, CEUR-WS.org 2007

Krol Kevin Mathias, Casey Lengacher, Derek Williams, Austin Cornett, Alex Dekhtyar, Judy Goldsmith: Factored MDP Elicitation and Plan Display. AAAI 2006: 1945-1946

Wenzhong Zhao, Alex Dekhtyar, Judy Goldsmith: A Framework for Management of Semistructured Probabilistic Data. J. Intell. Inf. Syst. 25(3): 293-332 (2005)

Judy Goldsmith, Robert H. Sloan: New Horn Revision Algorithms. Journal of Machine Learning Research 6: 1919-1938 (2005)

Alex Dekhtyar, Raphael A. Finkel, Judy Goldsmith, Beth Goldstein, Cynthia Isenhour: Adaptive Decision Support for Planning under Hard and Soft Constraints. AAAI Spring Symposium: Challenges to Decision Support in a Changing World 2005: 17-22

Judy Goldsmith, Jérôme Lang, Miroslaw Truszczynski, Nic Wilson: The computational complexity of dominance and consistency in CP-nets. IJCAI 2005: 144-149

Judy Goldsmith, Matthias Hagen, Martin Mundhenk: Complexity of DNF and Isomorphism of Monotone Formulas. MFCS 2005: 410-421

Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán: Theory revision with queries: Horn, read-once, and parity formulas. Artif. Intell. 156(2): 139-176 (2004)

Wenzhong Zhao, Jiangyu Li, Erik Jessup, Alex Dekhtyar, Judy Goldsmith: Building Bayes Nets with Semistructured Probabilistic DBMS. EMISA Forum 24(1): 28-29 (2004)

Wenzhong Zhao, Alex Dekhtyar, Judy Goldsmith: Databases for interval probabilities. Int. J. Intell. Syst. 19(9): 789-815 (2004)

Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán: New Revision Algorithms. ALT 2004: 395-409

Judy Goldsmith: Preferences and Domination. Algebraic Methods in Computational Complexity 2004

Alex Dekhtyar, Judy Goldsmith, Janice L. Pearce: When Plans Distinguish Bayes Nets. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 11(Supplement-2): 1-24 (2003)

Wenzhong Zhao, Alex Dekhtyar, Judy Goldsmith: Query Algebra Operations for Interval Probabilities. DEXA 2003: 527-536

Judy Goldsmith, Alex Dekhtyar, Wenzhong Zhao: Can Probabilistic Databases Help Elect Qualified Officials? FLAIRS Conference 2003: 501-505

Venkata Deepti Kiran Bhuma, Judy Goldsmith: Bidirectional LAO* algorithm. IICAI 2003: 980-992

Jignesh Doshi, Judy Goldsmith: Revising Unique Explanations. MAICS 2003: 24-30

Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán: Theory Revision with Queries: Horn, Read-once, and Parity Formulas. Electronic Colloquium on Computational Complexity (ECCC)(039) (2003)

Judy Goldsmith, Robert H. Sloan, György Turán: Theory Revision with Queries: DNF Formulas. Machine Learning 47(2-3): 257-295 (2002)

Christopher Lusena, Judy Goldsmith, Martin Mundhenk: Nonapproximability Results for Partially Observable Markov Decision Processes. J. Artif. Intell. Res. (JAIR) 14: 83-103 (2001)

Alex Dekhtyar, Judy Goldsmith, Sean R. Hawkes: Semistructured Probalistic Databases. SSDBM 2001: 36-45

Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe: Tally NP Sets and Easy Census Functions. Inf. Comput. 158(1): 29-52 (2000)

Martin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender: Complexity of finite-horizon Markov decision process problems. J. ACM 47(4): 681-720 (2000)

Judy Goldsmith: Book review: Theory of Computing: A Gentle Introduction by Kinber and Smith (Prentice-Hall, 2001). SIGACT News 31(3): 19-22 (2000)

Judy Goldsmith, Robert H. Sloan: The Complexity of Model Aggregation. AIPS 2000: 122-129

Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán: Improved Algorithms for Theory Revision with Queries. COLT 2000: 236-247

Judy Goldsmith, Robert H. Sloan: More theory revision with queries (extended abstract). STOC 2000: 441-448

Christopher Lusena, Judy Goldsmith, Martin Mundhenk: Nonapproximability Results for Partially Observable Markov Decision Processes. Universität Trier, Mathematik/Informatik, Forschungsbericht 00-12 (2000)

John V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan: An Algorithm for the Class of Pure Implicational Formulas. Discrete Applied Mathematics 96-97: 89-106 (1999)

Christopher Lusena, Tong Li, Shelia Sittinger, Chris Wells, Judy Goldsmith: My Brain is Full: When More Memory Helps. UAI 1999: 374-381

Martin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender: Complexity of Finite-Horizon Markov Decision process Problems. Universität Trier, Mathematik/Informatik, Forschungsbericht 99-25 (1999)

Michael L. Littman, Judy Goldsmith, Martin Mundhenk: The Computational Complexity of Probabilistic Planning. J. Artif. Intell. Res. (JAIR) 9: 1-36 (1998)

Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith: Sharply Bounded Alternation and Quasilinear Time. Theory Comput. Syst. 31(2): 187-214 (1998)

Richard Beigel, Judy Goldsmith: Downward Separation Fails Catastrophically for Limited Nondeterminism Classes. SIAM J. Comput. 27(5): 1420-1429 (1998)

Lance Fortnow, Judy Goldsmith, Matthew A. Levy, Stephen R. Mahaney: L-Printable Sets. SIAM J. Comput. 28(1): 137-151 (1998)

Judy Goldsmith, Martin Mundhenk: Complexity Issues in Markov Decision Processes. IEEE Conference on Computational Complexity 1998: 272-280

Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe: Tally NP Sets and Easy Census Functions. MFCS 1998: 483-492

Michael L. Littman, Judy Goldsmith, Martin Mundhenk: The Computational Complexity of Probabilistic Planning. CoRR cs.AI/9808101 (1998)

Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe: Tally NP Sets and Easy Census Functions. CoRR cs.CC/9809002 (1998)

Martin Mundhenk, Judy Goldsmith, Eric Allender: The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes. MFCS 1997: 129-138

Judy Goldsmith, Michael L. Littman, Martin Mundhenk: The Complexity of Plan Existence and Evaluation in Probabilistic Domains. UAI 1997: 182-189

Judy Goldsmith, Steven Homer: Scalability and the Isomorphism Problem. Inf. Process. Lett. 57(3): 137-143 (1996)

Judy Goldsmith, Matthew A. Levy, Martin Mundhenk: Limited nondeterminism. SIGACT News 27(2): 20-29 (1996)

Eric Allender, Joan Feigenbaum, Judy Goldsmith, Toniann Pitassi, Steven Rudich: The future of computational complexity theory: part II. SIGACT News 27(4): 3-7 (1996)

Lance Fortnow, Judy Goldsmith, Stephen R. Mahaney: L-Printable Sets. IEEE Conference on Computational Complexity 1996: 97-106

Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith: Sharply Bounded Alternation within P. Electronic Colloquium on Computational Complexity (ECCC) 3(11) (1996)

Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith: How hard are n2-hard problems? SIGACT News 25(2): 83-85 (1994)

Richard Beigel, Judy Goldsmith: Downward separation fails catastrophically for limited nondeterminism classes. Structure in Complexity Theory Conference 1994: 134-138

Judy Goldsmith, Deborah Joseph: Relativized Isomorphisms of NP-Complete Sets. Computational Complexity 3: 186-205 (1993)

Judy Goldsmith, Deborah Joseph, Paul Young: Using Self-Reducibilities to Characterize Polynomial Time. Inf. Comput. 104(2): 288-308 (1993)

Judy Goldsmith, Deborah Joseph, Paul Young: A Note on Bi-immunity and p-Closeness of p-Cheatable Sets in P/Poy. J. Comput. Syst. Sci. 46(3): 349-362 (1993)

Jonathan F. Buss, Judy Goldsmith: Nondeterminism Within P. SIAM J. Comput. 22(3): 560-572 (1993)

Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen: Polynomial-Time Compression. Computational Complexity 2: 18-39 (1992)

Judy Goldsmith, Lane A. Hemachandra, Deborah Joseph, Paul Young: Near-Testable Sets. SIAM J. Comput. 20(3): 506-523 (1991)

Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen: On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions. FSTTCS 1991: 212-223

Jonathan F. Buss, Judy Goldsmith: Nondterminism Within P. STACS 1991: 348-359

Judy Goldsmith, Deborah Joseph, Paul Young: Near-testable, P-cheatable, and P-terse sets. Structure in Complexity Theory Conference 1987

Judy Goldsmith, Deborah Joseph: Three Results on the Polynomial Isomorphism of Complete Sets. FOCS 1986: 390-397