894 search results - page 72 / 179 » Game Theory with Costly Computation |
127
click to vote
SOFSEM
2010
Springer
15 years 10 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
117
Voted
CHI
2004
ACM
15 years 7 months ago
2004
ACM
Due to fierce industry competition and demand for novelty, games are a fertile research setting for studying interface design, input devices, graphics, social communication and de...
128
click to vote
CCGRID
2007
IEEE
15 years 8 months ago
2007
IEEE
We study two problems directly resulting from organizational decentralization of the Grid. Firstly, the problem of fair scheduling in systems in which the grid scheduler has compl...
117
click to vote
IJACTAICIT
2010
14 years 8 months ago
2010
The theory of regions has been recognized as the optimal deadlock prevention policy based on the marking/transition-separation instance (MTSI) or the event-state-separation-proble...
109
click to vote
EMMCVPR
2001
Springer
15 years 6 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...