Sciweavers

2024 search results - page 352 / 405
» The cost of social agents
Sort
View
AAAI
1996
15 years 13 days ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
Richard J. Wallace
ICASSP
2010
IEEE
14 years 11 months ago
Distributed Lasso for in-network linear regression
The least-absolute shrinkage and selection operator (Lasso) is a popular tool for joint estimation and continuous variable selection, especially well-suited for the under-determin...
Juan Andrés Bazerque, Gonzalo Mateos, Georg...
91
Voted
JAIR
2008
145views more  JAIR 2008»
14 years 11 months ago
Communication-Based Decomposition Mechanisms for Decentralized MDPs
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
Claudia V. Goldman, Shlomo Zilberstein
AAAI
2010
14 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
IDEAL
2010
Springer
14 years 8 months ago
Robust 1-Norm Soft Margin Smooth Support Vector Machine
Based on studies and experiments on the loss term of SVMs, we argue that 1-norm measurement is better than 2-norm measurement for outlier resistance. Thus, we modify the previous 2...
Li-Jen Chien, Yuh-Jye Lee, Zhi-Peng Kao, Chih-Chen...