ISAIM 2006: Fort Lauderdale, Florida, USA

Keynote Speakers

• Thomas Dean:
  Hierarchical Bayesian Models of the Primate Visual Cortex.
  
• Carla Gomes:
  Adventures in Randomized Computational Methods.
  
• Jeffrey S. Rosenschein:
  Junta Distributions and the Average-Case Complexity of Manipulating Elections.
  

Special Sessions

Nonmonotonic Reasoning

• Alexander Bochman:
  Two Paradigms of Nonmonotonic Reasoning.
  
• Jim Delgrande:
  Towards a Rule-Based Interpretation of Conditional Defaults.
  
• Riccardo Rosati:
  Multimodal Nonmonotonic Logics of Minimal Knowledge.
  
• Mirek Truszczynski:
  Strong Equivalence of Nonmonotonic Theories -- an Algebraic Approach.
  

Planning under Uncertainty

• Blai Bonet:
  Bounded Branching and Modalities in Non-Deterministic Planning.
  
• Zhengzhu Feng:
  Region-Based Dynamic Programming for POMDPs.
  
• Milos Hauskrecht:
  Approximate Linear Programming for Solving Hybrid Factored MDPs.
  

Search and Optimization Techniques and their Applications

• Yixin Chen:
  Solving Constrained Nonlinear Optimization Problems Through Constraint Partitioning.
  
• Adele E. Howe:
  Modeling Search for Scheduling.
  
• Sven Koenig:
  Search for Robot Navigation under Incomplete Information.
  

Technical Papers

• Andreas Alexander Albrecht, Kathleen Steinhöfel:
  Run-time Estimates for Protein Folding Simulation in the H-P Model.
  
• Christopher Amato, Daniel S. Bernstein, Shlomo Zilberstein:
  Finding Optimal POMDP Controllers Using Quadratically Constrained Linear Programs.
  
• Zippora Arzi-Gonczarowski:
  Understanding One Another: Making Out AI Meanings with Boolean Equations.
  
• Vincent Auvray, Pierre Geurts, Louis Wehenkel:
  A Semi-Algebraic Description of Naive Bayes Models with Two Hidden Classes.
  
• Tao Chen, Nevin Lianwen Zhang:
  Quartet-Based Learning of Hierarchical Latent Class Models: Discovery of Shallow Latent Variables.
  
• David S. Dean, David Lancaster, Satya N. Majumdar:
  A Statistical Mechanics Approach to Random Euclidean MAX TSP.
  
• Thomas Dean:
  Scalable Inference in Hierarchical Generative Models.
  
• Dmitri A. Dolgov, Edmund H. Durfee:
  Symmetric Primal-Dual Approximate Linear Programming for Factored MDPs.
  
• Prashant Doshi, Piotr J. Gmytrasiewicz:
  On the Difficulty of Achieving Equilibrium in Interactive POMDPs.
  
• Valnir Ferreira Jr.:
  Backbone Guided Dynamic Local Search for Propositional Satisfiability.
  
• Moshe Fresko, Binyamin Rosenfeld, Ronen Feldman:
  A Hybrid Approach to NER by Integrating Manual Rules into MEMM.
  
• Matteo Gagliolo, Jürgen Schmidhuber:
  Dynamic Algorithm Portfolios.
  
• Peter Géczy, Shotaro Akaho, Shiro Usui:
  Efficient First Order Superlinear Algorithms.
  
• Francesco Di Giunta, Nicola Gatti:
  Bargaining in Bundle over Multiple Issues in Finite-Horizon Alternating-Offers Protocol.
  
• Amy Greenwald, Zheng Li, Casey Marks:
  Bounds for Regret-Matching Algorithms.
  
• Péter Hajnal, Zhihao Liu, György Turán:
  Nearest Neighbor Representations of Boolean Functions.
  
• Yannet Interian, Gabriel Corvera, Bart Selman, Ryan Williams:
  Finding Small Unsatisfiable Cores to Prove Unsatisfiability of QBFs.
  
• Marina Langlois, Robert H. Sloan, György Turán:
  Horn Upper Bounds of Random 3-CNF: A Computational Study.
  
• Lihong Li, Thomas J. Walsh, Michael L. Littman:
  Towards a Unified Theory of State Abstraction for MDPs.
  
• Inês Lynce, Joël Ouaknine:
  Sudoku as a SAT Problem.
  
• Shawn Martin:
  The Numerical Stability of Kernel Methods.
  
• Eric Mjolsness:
  Stochastic Process Semantics for Dynamical Grammar Syntax: An Overview.
  
• Praveen Paruchuri, Milind Tambe, Fernando Ordóñez, Sarit Kraus:
  Security in Multiagent Systems by Policy Randomization.
  
• Jonathan P. Pearce, Rajiv T. Maheswaran, Milind Tambe:
  Solution Sets for DCOPs and Graphical Games: Metrics and Bounds.
  
• Marek Petrik, Shlomo Zilberstein:
  Learning Static Parallel Portfolios of Algorithms.
  
• P. Rajamanar, Gurumurthi V. Ramanan:
  Roweis-Saul Classifier for Machine Learning.
  
• Emad Saad, Enrico Pontelli:
  Non-monotonic Negation in Hybrid Probabilistic Logic Programs.
  
• Robert St-Aubin, Joel Friedman, Alan K. Mackworth:
  A Formal Mathematical Framework for Modeling Probabilistic Hybrid Systems.
  
• Tapesh Santra, K. S. Venkatesh, Amitabha Mukerjee:
  The Cooperative Behavior of a Human Work Group: A Distributed Learning Approach.
  
• Marius-Calin Silaghi, Boi Faltings, Adrian Petcu:
  Secure Combinatorial Optimization Simulating DFS Tree-Based Variable Elimination.
  
• Adrian Silvescu, Vasant Honavar:
  Independence, Decomposability and Functions which Take Values into an Abelian Group.
  
• Mingzhou Song, Hongbin Wang:
  Detecting Low Complexity Clusters by Skewness and Kurtosis in Data Stream Clustering.
  
• Xiaohai Sun, Dominik Janzing, Bernhard Schölkopf:
  Causal Inference by Choosing Graphs with Most Plausible Markov Kernels.
  
• Ana Paula Tomás, António Leslie Bajuelos, Fábio Marques:
  On Visibility Problems in the Plane -- Solving Minimum Vertex Guard Problems by Successive Approximations.
  
• John R. Wicks, Amy Greenwald:
  A Quotient Construction on Markov Chains with Applications to the Theory of Generalized Simulated Annealing.
  
• Honglei Zeng, Sheila A. McIlraith:
  Experimental Results on the Satisfiable Core in Random 3SAT.
  

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