1034 search results - page 87 / 207 » Competitive generalized auctions |
77
Voted
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
We present a general PAC-Bayes theorem from which all known PAC-Bayes risk bounds are obtained as particular cases. We also propose different learning algorithms for finding linea...
SPAA
2010
ACM
15 years 5 months ago
2010
ACM
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
88
Voted
MFCS
2001
Springer
15 years 5 months ago
2001
Springer
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...
95
Voted
DIGRA
2005
Springer
15 years 6 months ago
2005
Springer
A general technique is proposed to deal with the formalization of intuition and human-oriented concepts in competition thinking games like chess, such as defensive play, attack, t...
99
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
This paper proposes a novel constructive learning algorithm for a competitive neural network. The proposed algorithm is developed by taking ideas from the immune system and demons...