Sciweavers

214 search results - page 28 / 43
» Finding Optimal Strategies for Imperfect Information Games
Sort
View
ICASSP
2009
IEEE
13 years 5 months ago
Tree configuration games for distributed stream mining systems
We consider the problem of configuring classifier trees in distributed stream mining system. The configuration involves selecting appropriate false-alarm detection tradeoffs for e...
Hyunggon Park, Deepak S. Turaga, Olivier Verscheur...
AAAI
1997
13 years 9 months ago
Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Milos Hauskrecht
DATAMINE
2010
175views more  DATAMINE 2010»
13 years 7 months ago
Extracting influential nodes on a social network for information diffusion
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
Masahiro Kimura, Kazumi Saito, Ryohei Nakano, Hiro...
FDG
2009
ACM
14 years 2 months ago
An exploration of menu techniques using a 3D game input device
Existing work on menu techniques has shown linear menus to be less efficient and reliable for menuing tasks when compared to radial menus. With the rise in popularity of 3D spatia...
Dustin B. Chertoff, Ross W. Byers, Joseph J. LaVio...
SIGMETRICS
2008
ACM
13 years 7 months ago
Joint rate-and-power allocation for multi-channel spectrum sharing networks
abstract, we propose a study on joint rate-and-power allocation problem for multi-channel spectrum sharing networks (SSNs). We formulate this cross-layer optimization problem as a...
Yuan Wu, Danny H. K. Tsang