Sciweavers

AAAI
2010
13 years 1 months ago
Cloning in Elections
We consider the problem of manipulating elections via cloning candidates. In our model, a manipulator can replace each candidate c by one or more clones, i.e., new candidates that...
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
AAAI
2010
13 years 1 months ago
Latent Class Models for Algorithm Portfolio Methods
Different solvers for computationally difficult problems such as satisfiability (SAT) perform best on different instances. Algorithm portfolios exploit this phenomenon by predicti...
Bryan Silverthorn, Risto Miikkulainen
AAAI
2010
13 years 2 months ago
A Trust Model for Supply Chain Management
hey generalize these factors to the abstract concepts of ability, integrity, and benevolence. This model does not use probabilistic decision theory. Other SCM trust factors have be...
Yasaman Haghpanah, Marie desJardins
AAAI
2010
13 years 2 months ago
Simultaneous Elicitation of Preference Features and Utility
Most frameworks for utility elicitation assume a predefined set of features over which user preferences are expressed. We consider utility elicitation in the presence of subjecti...
Craig Boutilier, Kevin Regan, Paolo Viappiani
AAAI
2010
13 years 3 months ago
Biped Walk Learning Through Playback and Corrective Demonstration
Developing a robust, flexible, closed-loop walking algorithm for a humanoid robot is a challenging task due to the complex dynamics of the general biped walk. Common analytical ap...
Çetin Meriçli, Manuela M. Veloso
AAAI
2010
13 years 3 months ago
Computing Cost-Optimal Definitely Discriminating Tests
The goal of testing is to discriminate between multiple hypotheses about a system--for example, different fault diagnoses--by applying input patterns and verifying or falsifying t...
Anika Schumann, Jinbo Huang, Martin Sachenbacher
AAAI
2010
13 years 3 months ago
Algorithms for Finding Approximate Formations in Games
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
Patrick R. Jordan, Michael P. Wellman
AAAI
2010
13 years 3 months ago
Inducing Probability Distributions from Knowledge Bases with (In)dependence Relations
When merging belief sets from different agents, the result is normally a consistent belief set in which the inconsistency between the original sources is not represented. As proba...
Jianbing Ma, Weiru Liu, Anthony Hunter
AAAI
2010
13 years 3 months ago
An Optimization Variant of Multi-Robot Path Planning Is Intractable
An optimization variant of a problem of path planning for multiple robots is addressed in this work. The task is to find spatial-temporal path for each robot of a group of robots ...
Pavel Surynek