Sciweavers

1599 search results - page 180 / 320
» Algorithms for Parity Games
Sort
View
ICIP
2010
IEEE
15 years 4 months ago
A game theoretical approach for image denoising
How to adaptively choose optimal neighborhoods is very important to pixel-domain image denoising algorithms since too many neighborhoods may cause over-smooth artifacts and too fe...
Yan Chen, K. J. Ray Liu
WINE
2010
Springer
162views Economy» more  WINE 2010»
15 years 4 months ago
Near-Strong Equilibria in Network Creation Games
We introduce a new solution concept for games, near-strong equilibrium, a variation of strong equilibrium. Previous work has shown the existence of 2-strong pure strategy equilibr...
Ola Rozenfeld, Moshe Tennenholtz
TCIAIG
2010
15 years 1 months ago
The Parametrized Probabilistic Finite-State Transducer Probe Game Player Fingerprint Model
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory ...
Jeffrey Tsang
DCC
2005
IEEE
16 years 6 months ago
The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments
A v-player whist tournament is a schedule of games, where in each round the v players are partitioned into games of four players each with at most one player left over. In each ga...
Harri Haanpää, Petteri Kaski
SASO
2009
IEEE
16 years 1 months ago
Self-organizing Bandwidth Sharing in Priority-Based Medium Access
In this paper, we present an analysis of self-organizing bandwidth sharing in priority-based medium access. For this purpose, the priority-based Access Game is introduced. Analysi...
Stefan Wildermann, Tobias Ziermann, Jürgen Te...