3353 search results - page 272 / 671 » Laver and set theory |
174
click to vote
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
173
click to vote
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We consider the existence of Partition Equilibrium in Resource Selection Games. Super-strong equilibrium, where no subset of players has an incentive to change their stra...
180
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
1 A kernel determines the inductive bias of a learning algorithm on a specific data set, and it is beneficial to design specific kernel for a given data set. In this work, we propo...
168
click to vote
ICFCA
2005
Springer
16 years 4 days ago
2005
Springer
Minimal generators (or mingen) constitute a remarkable part of the closure space landscape since they are the antipodes of the closures, i.e., minimal sets in the underlying equiva...
178
click to vote
ICAT
2003
IEEE
15 years 12 months ago
2003
IEEE
Light field rendering (LFR) is a fundamental method for generating new views from a set of pre-acquired images. We use densely-aligned cameras for the process of acquiring the se...