Sciweavers

1176 search results - page 75 / 236
» Exploiting Online Games
Sort
View
ICML
2003
IEEE
14 years 10 months ago
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
Martin Zinkevich
WADS
2009
Springer
245views Algorithms» more  WADS 2009»
14 years 4 months ago
Online Square Packing
We analyze the problem of packing squares in an online fashion: Given an semi-infinite strip of width 1 and an unknown sequence of squares with side lengths in [0, 1] that arrive...
Sándor P. Fekete, Tom Kamphans, Nils Schwee...
CAINE
2008
13 years 11 months ago
Scripted Artificially Intelligent Basic Online Tactical Simulation
For many years, introductory Computer Science courses have followed the same teaching paradigms. These paradigms utilize only simple console windows; more interactive approaches t...
Jesse D. Phillips, Roger V. Hoang, Joseph D. Mahsm...
GLOBECOM
2009
IEEE
14 years 4 months ago
Dynamic Power Management in Cognitive Radio Networks Based on Constrained Stochastic Games
Abstract—Recent studies have been conducted to indicate the ineffective usage of licensed bands due to the static spectrum allocation. In order to improve the spectrum utilizatio...
Chia-Wei Wang, Yu-Pin Hsu, Kai-Ten Feng
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 9 months ago
Coverage games in small cells networks
Abstract: This paper considers the problem of cooperative power control in distributed small cell wireless networks. We introduce a novel framework, based on repeated games, which ...
Mael Le Treust, Hamidou Tembine, Samson Lasaulce, ...