Sciweavers

11 search results - page 2 / 3
» Fast algorithms for finding proper strategies in game trees
Sort
View
ATAL
2008
Springer
13 years 6 months ago
A heads-up no-limit Texas Hold'em poker player: discretized betting models and automatically generated equilibrium-finding progr
We present Tartanian, a game theory-based player for headsup no-limit Texas Hold'em poker. Tartanian is built from three components. First, to deal with the virtually infinit...
Andrew Gilpin, Tuomas Sandholm, Troels Bjerre S&os...
ATAL
2008
Springer
13 years 6 months ago
GS3 and Tartanian: game theory-based heads-up limit and no-limit Texas Hold'em poker-playing programs
We demonstrate two game theory-based programs for headsup limit and no-limit Texas Hold'em poker. The first player, GS3, is designed for playing limit Texas Hold'em, in ...
Andrew Gilpin, Tuomas Sandholm, Troels Bjerre S&os...
ESA
2009
Springer
107views Algorithms» more  ESA 2009»
13 years 11 months ago
Disproof of the Neighborhood Conjecture with Implications to SAT
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
Heidi Gebauer
ICIP
1998
IEEE
14 years 6 months ago
Adaptive Wavelet Packet Image Coding using an Estimation-Quantization Framework
In this paper, we extend the statistical model-based Estimation-Quantization (EQ) wavelet image coding algorithm introduced in [?] to include an adaptive transform component. For ...
Kannan Ramchandran, Mehmet Kivanç Mih&ccedi...
CCE
2008
13 years 4 months ago
Bidirectional branch and bound for controlled variable selection: Part I. Principles and minimum singular value criterion
The minimum singular value (MSV) rule is a useful tool for selecting controlled variables (CVs) from the available measurements. However, the application of the MSV rule to large-...
Yi Cao, Vinay Kariwala