Table of Contents

• Scalable Inference in Hierarchical Generative ModelsThomas Dean. [doi]
• Non-monotonic Negation in Hybrid Probabilistic Logic ProgramsEmad Saad, Enrico Pontelli. [doi]
• Adventures in Randomized Computational MethodsCarla P. Gomes. [doi]
• A Formal Mathematical Framework for Modeling Probabilistic Hybrid SystemsRobert St-Aubin, Joel Friedman, Alan K. Mackworth. [doi]
• On Visibility Problems in the Plane -- Solving Minimum Vertex Guard Problems by Successive ApproximationsAna Paula Tomás, António Leslie Bajuelos, Fábio Marques. [doi]
• Causal Inference by Choosing Graphs with Most Plausible Markov KernelsXiaohai Sun, Dominik Janzing, Bernhard Schölkopf. [doi]
• Strong Equivalence of Nonmonotonic Theories -- an Algebraic ApproachMirek Truszczynski. [doi]
• Multimodal Nonmonotonic Logics of Minimal KnowledgeRiccardo Rosati. [doi]
• Efficient First Order Superlinear AlgorithmsPeter Géczy, Shotaro Akaho, Shiro Usui. [doi]
• Two Paradigms of Nonmonotonic ReasoningAlexander Bochman. [doi]
• Hierarchical Bayesian Models of the Primate Visual CortexThomas Dean. [doi]
• Security in Multiagent Systems by Policy RandomizationPraveen Paruchuri, Milind Tambe, Fernando Ordóñez, Sarit Kraus. [doi]
• Solving Constrained Nonlinear Optimization Problems Through Constraint PartitioningYixin Chen. [doi]
• A Quotient Construction on Markov Chains with Applications to the Theory of Generalized Simulated AnnealingJohn R. Wicks, Amy Greenwald. [doi]
• Symmetric Primal-Dual Approximate Linear Programming for Factored MDPsDmitri A. Dolgov, Edmund H. Durfee. [doi]
• Nearest Neighbor Representations of Boolean FunctionsPéter Hajnal, Zhihao Liu, György Turán. [doi]
• Secure Combinatorial Optimization Simulating DFS Tree-Based Variable EliminationMarius-Calin Silaghi, Boi Faltings, Adrian Petcu. [doi]
• A Statistical Mechanics Approach to Random Euclidean MAX TSPDavid S. Dean, David Lancaster, Satya N. Majumdar. [doi]
• Search for Robot Navigation under Incomplete InformationSven Koenig. [doi]
• Dynamic Algorithm PortfoliosMatteo Gagliolo, Jürgen Schmidhuber. [doi]
• Solution Sets for DCOPs and Graphical Games: Metrics and BoundsJonathan P. Pearce, Rajiv T. Maheswaran, Milind Tambe. [doi]
• Junta Distributions and the Average-Case Complexity of Manipulating ElectionsJeffrey S. Rosenschein. [doi]
• A Hybrid Approach to NER by Integrating Manual Rules into MEMMMoshe Fresko, Binyamin Rosenfeld, Ronen Feldman. [doi]
• Stochastic Process Semantics for Dynamical Grammar Syntax: An OverviewEric Mjolsness. [doi]
• Horn Upper Bounds of Random 3-CNF: A Computational StudyMarina Langlois, Robert H. Sloan, György Turán. [doi]
• Finding Small Unsatisfiable Cores to Prove Unsatisfiability of QBFsYannet Interian, Gabriel Corvera, Bart Selman, Ryan Williams. [doi]
• Detecting Low Complexity Clusters by Skewness and Kurtosis in Data Stream ClusteringMingzhou Song, Hongbin Wang. [doi]
• Quartet-Based Learning of Hierarchical Latent Class Models: Discovery of Shallow Latent VariablesTao Chen, Nevin Lianwen Zhang. [doi]
• Bounds for Regret-Matching AlgorithmsAmy Greenwald, Zheng Li, Casey Marks. [doi]
• Independence, Decomposability and Functions which Take Values into an Abelian GroupAdrian Silvescu, Vasant Honavar. [doi]
• A Semi-Algebraic Description of Naive Bayes Models with Two Hidden ClassesVincent Auvray, Pierre Geurts, Louis Wehenkel. [doi]
• Modeling Search for SchedulingAdele E. Howe. [doi]
• Understanding One Another: Making Out AI Meanings with Boolean EquationsZippora Arzi-Gonczarowski. [doi]
• Bounded Branching and Modalities in Non-Deterministic PlanningBlai Bonet. [doi]
• Roweis-Saul Classifier for Machine LearningP. Rajamanar, Gurumurthi V. Ramanan. [doi]
• Sudoku as a SAT ProblemInês Lynce, Joël Ouaknine. [doi]
• Towards a Rule-Based Interpretation of Conditional DefaultsJim Delgrande. [doi]
• Approximate Linear Programming for Solving Hybrid Factored MDPsMilos Hauskrecht. [doi]
• Region-Based Dynamic Programming for POMDPsZhengzhu Feng. [doi]
• Towards a Unified Theory of State Abstraction for MDPsLihong Li, Thomas J. Walsh, Michael L. Littman. [doi]
• The Cooperative Behavior of a Human Work Group: A Distributed Learning ApproachTapesh Santra, K. S. Venkatesh, Amitabha Mukerjee. [doi]
• Finding Optimal POMDP Controllers Using Quadratically Constrained Linear ProgramsChristopher Amato, Daniel S. Bernstein, Shlomo Zilberstein. [doi]
• The Numerical Stability of Kernel MethodsShawn Martin. [doi]
• Learning Static Parallel Portfolios of AlgorithmsMarek Petrik, Shlomo Zilberstein. [doi]
• Backbone Guided Dynamic Local Search for Propositional SatisfiabilityValnir Ferreira Jr.. [doi]
• On the Difficulty of Achieving Equilibrium in Interactive POMDPsPrashant Doshi, Piotr J. Gmytrasiewicz. [doi]
• Run-time Estimates for Protein Folding Simulation in the H-P ModelAndreas Alexander Albrecht, Kathleen Steinhöfel. [doi]
• Experimental Results on the Satisfiable Core in Random 3SATHonglei Zeng, Sheila A. McIlraith. [doi]
• Bargaining in Bundle over Multiple Issues in Finite-Horizon Alternating-Offers ProtocolFrancesco Di Giunta, Nicola Gatti. [doi]