Sciweavers

533 search results - page 56 / 107
» Playing games with approximation algorithms
Sort
View
SPIRE
2005
Springer
14 years 1 months ago
Faster Generation of Super Condensed Neighbourhoods Using Finite Automata
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
Luís M. S. Russo, Arlindo L. Oliveira
INFOCOM
2009
IEEE
14 years 2 months ago
Hardness and Approximation of the Survivable Multi-Level Fat Tree Problem
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
Hung Q. Ngo, Thanh-Nhan Nguyen, Dahai Xu
CORR
2008
Springer
125views Education» more  CORR 2008»
13 years 7 months ago
Semidefinite programming for N-Player Games
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
Rida Laraki, Jean B. Lasserre
CIVR
2007
Springer
210views Image Analysis» more  CIVR 2007»
14 years 1 months ago
Semantic video analysis for psychological research on violence in computer games
In this paper, we present an automatic semantic video analysis system to support interdisciplinary research efforts in the field of psychology and media science. The psychological...
Markus Mühling, Ralph Ewerth, Thilo Stadelman...
MFCS
2009
Springer
14 years 2 months ago
The Cost of Stability in Network Flow Games
The core of a cooperative game contains all stable distributions of a coalition’s gains among its members. However, some games have an empty core, with every distribution being ...
Ezra Resnick, Yoram Bachrach, Reshef Meir, Jeffrey...