Sciweavers

64 search results - page 3 / 13
» *-Minimax Performance in Backgammon
Sort
View
TIT
2008
102views more  TIT 2008»
13 years 7 months ago
State Estimation With Initial State Uncertainty
Abstract--The problem of state estimation with initial state uncertainty is approached from a statistical decision theory point of view. The initial state is regarded as determinis...
Yoav Levinbook, Tan F. Wong
TSP
2010
13 years 2 months ago
Efficient recursive estimators for a linear, time-varying Gaussian model with general constraints
The adaptive estimation of a time-varying parameter vector in a linear Gaussian model is considered where we a priori know that the parameter vector belongs to a known arbitrary s...
Stefan Uhlich, Bin Yang
TNN
1998
132views more  TNN 1998»
13 years 7 months ago
Synthesis of fault-tolerant feedforward neural networks using minimax optimization
—In this paper we examine a technique by which fault tolerance can be embedded into a feedforward network leading to a network tolerant to the loss of a node and its associated w...
Dipti Deodhare, M. Vidyasagar, S. Sathiya Keerthi
CIG
2005
IEEE
13 years 9 months ago
Monte Carlo Planning in RTS Games
Abstract- Monte Carlo simulations have been successfully used in classic turn–based games such as backgammon, bridge, poker, and Scrabble. In this paper, we apply the ideas to th...
Michael Chung, Michael Buro, Jonathan Schaeffer
CG
2000
Springer
13 years 11 months ago
A Least-Certainty Heuristic for Selective Search
: We present a new algorithm for selective search by iterative expansion of leaf nodes. The algorithm reasons with leaf evaluations in a way that leads to high confidence in the c...
Paul E. Utgoff, Richard P. Cochran