Sciweavers

5995 search results - page 377 / 1199
» Algorithmic Game Theory
Sort
View
SAT
2004
Springer
106views Hardware» more  SAT 2004»
16 years 27 days ago
Local Search with Bootstrapping
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
Lengning Liu, Miroslaw Truszczynski
ICML
2003
IEEE
16 years 8 months ago
Learning To Cooperate in a Social Dilemma: A Satisficing Approach to Bargaining
Learning in many multi-agent settings is inherently repeated play. This calls into question the naive application of single play Nash equilibria in multi-agent learning and sugges...
Jeff L. Stimpson, Michael A. Goodrich
RSKT
2009
Springer
16 years 2 months ago
Learning Optimal Parameters in Decision-Theoretic Rough Sets
A game-theoretic approach for learning optimal parameter values for probabilistic rough set regions is presented. The parameters can be used to define approximation regions in a p...
Joseph P. Herbert, Jingtao Yao
GLOBECOM
2008
IEEE
16 years 2 months ago
A Low-Signalling Scheme for Distributed Resource Allocation in Multi-Cellular OFDMA Systems
—This paper considers distributed protocol design for joint sub-carrier, transmission scheduling and power management in uplink/downlink multi-cellular OFDMA wireless networks. T...
Pablo Soldati, Mikael Johansson
IAT
2005
IEEE
16 years 1 months ago
An Approximate Pareto Optimal Cooperative Negotiation Model for Multiple
Cooperative negotiation is proved to be an effective paradigm to solve complex dynamic multi-objective problems in which each objective is associated to an agent. When the multi-o...
Nicola Gatti, Francesco Amigoni