14158 search results - page 73 / 2832 » Generalized switch-setting problems |
164
click to vote
SIAMCO
2010
15 years 4 months ago
2010
In this paper we study the nonzero-sum Dynkin game in continuous time, which is a two-player noncooperative game on stopping times. We show that it has a Nash equilibrium point for...
161
click to vote
SSPR
2010
Springer
15 years 4 months ago
2010
Springer
We propose a fast population game dynamics, motivated by the analogy with infection and immunization processes within a population of “players,” for finding dominant sets, a p...
160
click to vote
IPL
2010
15 years 4 months ago
2010
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
182
click to vote
JMLR
2010
15 years 28 days ago
2010
Bandit algorithms are concerned with trading exploration with exploitation where a number of options are available but we can only learn their quality by experimenting with them. ...
171
click to vote
SIAMDM
1998
15 years 5 months ago
1998
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...