Search

Search Results

• Greedy or Not? Best Improving versus First Improving Stochastic Local Search for MAXSAT

  Darrell Whitley, Adele Howe, Doug Hains

  940-946

  2013-06-30

• How Bad Is Selfish Voting?

  Simina Branzei, Ioannis Caragiannis, Jamie Morgenstern, Ariel Procaccia

  138-144

  2013-06-30

• On the Social Welfare of Mechanisms for Repeated Batch Matching

  Elliot Anshelevich, Meenal Chhabra, Sanmay Das, Matthew Gerrior

  60-66

  2013-06-30

• Basis Adaptation for Sparse Nonlinear Reinforcement Learning

  Sridhar Mahadevan, Stephen Giguere, Nicholas Jacek

  654-660

  2013-06-30

• HC-Search: Learning Heuristics and Cost Functions for Structured Prediction

  Janardhan Rao Doppa, Alan Fern, Prasad Tadepalli

  253-259

  2013-06-30

• Clustering with Complex Constraints — Algorithms and Applications

  Weifeng Zhi, Xiang Wang, Buyue Qian, Patrick Butler, Naren Ramakrishnan, Ian Davidson

  1056-1062

  2013-06-30

• Robust Bidirectional Search via Heuristic Improvement

  Christopher Wilt, Wheeler Ruml

  954-961

  2013-06-30

• Enforcing Meter in Finite-Length Markov Sequences

  Pierre Roy, Francois Pachet

  854-861

  2013-06-30

• Resolution and Parallelizability: Barriers to the Efficient Parallelization of SAT Solvers

  George Katsirelos, Ashish Sabharwal, Horst Samulowitz, Laurent Simon

  481-488

  2013-06-30

• Teamwork with Limited Knowledge of Teammates

  Samuel Barrett, Peter Stone, Sarit Kraus, Avi Rosenfeld

  102-108

  2013-06-30

• Instructor Rating Markets

  Mithun Chakraborty, Sanmay Das, Allen Lavoie, Malik Magdon-Ismail, Yonatan Naamad

  159-165

  2013-06-30

• Partial MUS Enumeration

  Alessandro Previti, Joao Marques-Silva

  818-825

  2013-06-30

• Posted Prices Exchange for Display Advertising Contracts

  Yagil Engel, Moshe Tennenholtz

  276-282

  2013-06-30

• Parameterized Complexity Results for Plan Reuse

  Ronald de Haan, Anna Roubickova, Stefan Szeider

  224-231

  2013-06-30

• A Morphogenetically Assisted Design Variation Tool

  Aaron Adler, Fusun Yaman, Jacob Beal, Jeffrey Cleveland, Hala Mostafa, Annan Mozeika

  9-15

  2013-06-30

• Optimal Coalition Structure Generation in Cooperative Graph Games

  Yoram Bachrach, Pushmeet Kohli, Vladimir Kolmogorov, Morteza Zadimoghaddam

  81-87

  2013-06-30

• Algorithms for Strong Nash Equilibrium with More than Two Agents

  Nicola Gatti, Marco Rocco, Tuomas Sandholm

  342-349

  2013-06-30

• SMILe: Shuffled Multiple-Instance Learning

  Gary Doran, Soumya Ray

  260-266

  2013-06-30

• Optimizing Objective Function Parameters for Strength in Computer Game-Playing

  Yoshikuni Sato, Makoto Miwa, Shogo Takeuchi, Daisuke Takahashi

  869-875

  2013-06-30

• Story Generation with Crowdsourced Plot Graphs

  Boyang Li, Stephen Lee-Urban, George Johnston, Mark Riedl

  598-604

  2013-06-30

• Reduce and Re-Lift: Bootstrapped Lifted Likelihood Maximization for MAP

  Fabian Hadiji, Kristian Kersting

  394-400

  2013-06-30

• Automatic Identification of Conceptual Metaphors With Limited Knowledge

  Lisa Gandy, Nadji Allan, Mark Atallah, Ophir Frieder, Newton Howard, Sergey Kanareykin, Moshe Koppel, Mark Last, Yair Neuman, Shlomo Argamon

  328-334

  2013-06-30

• Answering Counting Aggregate Queries over Ontologies of the DL-Lite Family

  Egor Kostylev, Juan Reutter

  534-540

  2013-06-30

• Complexity of Inferences in Polytree-shaped Semi-Qualitative Probabilistic Networks

  Cassio de Campos, Fabio Cozman

  217-223

  2013-06-30

• Red-Black Relaxed Plan Heuristics

  Michael Katz, Joerg Hoffmann, Carmel Domshlak

  489-495

  2013-06-30