Sciweavers

227 search results - page 12 / 46
» Generalized multiagent learning with performance bound
Sort
View
GECCO
2006
Springer
205views Optimization» more  GECCO 2006»
14 years 21 days ago
Bounding XCS's parameters for unbalanced datasets
This paper analyzes the behavior of the XCS classifier system on imbalanced datasets. We show that XCS with standard parameter settings is quite robust to considerable class imbal...
Albert Orriols-Puig, Ester Bernadó-Mansilla
ICML
1998
IEEE
14 years 9 months ago
A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
Michael J. Kearns, Yishay Mansour
ATAL
2010
Springer
13 years 10 months ago
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, ...
AAAI
2007
13 years 11 months ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein
ECAI
2008
Springer
13 years 10 months ago
A hybrid approach to multi-agent decision-making
Abstract. In the aftermath of a large-scale disaster, agents’ decisions derive from self-interested (e.g. survival), common-good (e.g. victims’ rescue) and teamwork (e.g. fire...
Paulo Trigo, Helder Coelho