ISAIM 2004: Fort Lauderdale, Florida, USA

• Alexander Bochman:
  Production Inference, Nonmonotonicity and Abduction.
  
• Stefan Boettcher, Gabriel Istrate, Allon G. Percus:
  Spines of Random Constraint Satisfaction Problems: Definition and Impact on Computational Complexity.
  
• Martine Ceberio, François Modave:
  Interval-Based Multicriteria Decision Making.
  
• Douglas Cenzer, V. Wiktor Marek, Jeffrey B. Remmel:
  Using Logic Programs to Reason about Infinite Sets.
  
• Hubie Chen:
  The Expressive Rate of Constraints.
  
• Ian Davidson, Minoo Aminian:
  Using the Central Limit Theorem for Belief Network Learning.
  
• Dmitri A. Dolgov, Edmund H. Durfee:
  Approximate Probabilistic Constraints and Risk-Sensitive Optimization Criteria in Markov Decision Processes.
  
• Ashutosh Garg, T. S. Jayram, Shivakumar Vaithyanathan, Huaiyu Zhu:
  Generalized Opinion Pooling.
  
• Piotr J. Gmytrasiewicz, Prashant Doshi:
  A Framework for Sequential Planning in Multi-Agent Settings.
  
• Y. Guo, A. Lim, B. Rodrigues, Y. Zhu:
  Heuristics for a Brokering Set Packing Problem.
  
• Brahim Hnich, Zeynep Kiziltan, Toby Walsh:
  Combining Symmetry Breaking with Other Constraints: Lexicographic Ordering with Sums.
  
• Gaofeng Huang, Andrew Lim:
  A Simple Yet Effective Framework for Optimization Problems.
  
• Kaizhu Huang, Haiqin Yang, Irwin King, Michael R. Lyu, Laiwan Chan:
  Biased Minimax Probability Machine for Medical Diagnosis.
  
• Amar Isli:
  Combining Cardinal Direction Relations and Relative Relations in QSR.
  
• Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä:
  Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits.
  
• Gytis Karciauskas, Finn Verner Jensen, Tomás Kocka:
  Parameter Reusing in Learning Latent Class Models.
  
• Kalev Kask, Rina Dechter, Vibhav Gogate:
  New Look-Ahead Schemes for Constraint Satisfaction.
  
• Andrew C. Lee:
  Learning via Finitely Many Queries.
  
• Debasis Mitra:
  Modeling and Reasoning with Star Calculus.
  
• Apurva Mudgal, Craig A. Tovey, Sven Koenig:
  Analysis of Greedy Robot-Navigation Methods.
  
• Justin Pearson:
  Symmetry Breaking in Constraint Satisfaction with Graph-Isomorphism: Comma-Free Codes.
  
• Riccardo Pucella:
  Deductive Algorithmic Knowledge.
  
• Angelo C. Restificar, Peter Haddawy:
  Inferring Utilities from Negotiation Actions.
  
• Haiou Shen, Hantao Zhang:
  Improving Exact Algorithms for MAX-2-SAT.
  
• William D. Smart:
  Explicit Manifold Representations for Value-Function Approximation in Reinforcement Learning.
  
• Dave A. D. Tompkins, Holger H. Hoos:
  Warped Landscapes and Random Acts of SAT Solving.
  
• Miroslav N. Velev:
  Using Automatic Case Splits and Efficient CNF Translation to Guide a SAT-solver when Formally Verifying Out-Of-Order Processors.
  
• Christopher D. Walton:
  Multi-Agent Dialogue Protocols.
  
• Ke Yin, Ian Davidson:
  Bayesian Model Averaging Across Model Spaces via Compact Encoding.
  
• Yi Zhu, Andrew Lim:
  Crane Scheduling with Spatial Constraints: Mathematical Models and Solving Approaches.
  

Last update Fri May 25 08:23:38 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page