• Preprocessing versus search processing for constraint satisfaction problems 

  Wallace, Richard J. (Sun SITE Central Europe (CEUR) / RWTH Aachen University, 2016-11)

  A perennial problem in hybrid backtrack CSP search is how much local consistency processing should be done to achieve the best efficiency. This can be divided into two separate questions: (1) how much work should be done ...
• Preference inference through rescaling preference learning 

  Wilson, Nic; Montazery, Mojtaba (International Joint Conferences on Artificial Intelligence Organization, 2016)

  One approach to preference learning, based on linear support vector machines, involves choosing a weight vector whose associated hyperplane has maximum margin with respect to an input set of preference vectors, and using ...
• A distributed asynchronous solver for Nash Equilibria in hypergraphical games 

  Wahbi, Mohamed; Brown, Kenneth N. (IOS Press, 2016-01)

  Hypergraphical games provides a compact model of a network of self-interested agents, each involved in simultaneous subgames with its neighbors. The overall aim is for the agents in the network to reach a Nash Equilibrium, ...
• A general characterization of Model-Based Diagnosis 

  Provan, Gregory (IOS Press, 2016-01)

  The Model-Based Diagnosis (MBD) framework developed by Reiter has been a strong theoretical foundation for MBD, yet is limited to models that are described in terms of logical sentences. We propose a more general framework ...
• An improved state filter algorithm for SIR epidemic forecasting 

  Huang, Weipeng; Provan, Gregory (IOS Press, 2016-01)

  In epidemic modeling, state filtering is an excellent tool for enhancing the performance of traditional epidemic models. We introduce a novel state filter algorithm to further improve the performance of state-of-the-art ...

View more