Sciweavers

DIS
2010
Springer
13 years 9 months ago
Concept Convergence in Empirical Domains
How to achieve shared meaning is a significant issue when more than one intelligent agent is involved in the same domain. We define the task of concept convergence, by which intell...
Santiago Ontañón, Enric Plaza
ATAL
2010
Springer
13 years 9 months ago
Agent-encapsulated Bayesian networks and the rumor problem
Scott Langevin, Marco Valtorta, Mark Bloemeke
ATAL
2010
Springer
13 years 9 months ago
Occlusion-aware multi-UAV surveillance
We present an agent-based coordination and planning method for aerial surveillance of multiple urban areas using a group of fixed-wing unmanned aerial vehicles (UAVs). The method ...
Eduard Semsch, Michal Jakob, Dusan Pavlícek...
ATAL
2010
Springer
13 years 9 months ago
Graphically explaining norms
Madalina Croitoru, Nir Oren, Simon Miles, Michael ...
AAAI
2010
13 years 9 months ago
A New Algorithm for Weighted Partial MaxSAT
We present and implement a Weighted Partial MaxSAT solver based on successive calls to a SAT solver. We prove the correctness of our algorithm and compare our solver with other We...
Carlos Ansótegui, Maria Luisa Bonet, Jordi ...
AAAI
2010
13 years 9 months ago
A Lower Bound on the Size of Decomposable Negation Normal Form
We consider in this paper the size of a Decomposable Negation Normal Form (DNNF) that respects a given vtree (known as structured DNNF). This representation of propositional knowl...
Thammanit Pipatsrisawat, Adnan Darwiche
AAAI
2010
13 years 9 months ago
Non-I.I.D. Multi-Instance Dimensionality Reduction by Learning a Maximum Bag Margin Subspace
Multi-instance learning, as other machine learning tasks, also suffers from the curse of dimensionality. Although dimensionality reduction methods have been investigated for many ...
Wei Ping, Ye Xu, Kexin Ren, Chi-Hung Chi, Shen Fur...
AAAI
2010
13 years 9 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 9 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