Sciweavers

1033 search results - page 9 / 207
» Stop the numbers game
Sort
View
ICANN
2005
Springer
14 years 4 months ago
Some Issues About the Generalization of Neural Networks for Time Series Prediction
Abstract. Some issues about the generalization of ANN training are investigated through experiments with several synthetic time series and real world time series. One commonly acce...
Wen Wang, Pieter H. A. J. M. van Gelder, J. K. Vri...
EOR
2007
123views more  EOR 2007»
13 years 10 months ago
Dynamic programming analysis of the TV game "Who wants to be a millionaire?"
This paper uses dynamic programming to investigate when contestants should use lifelines or when they should just stop answering in the TV quiz show ‘Who wants to be a millionai...
Federico Perea, Justo Puerto
CSL
2008
Springer
14 years 20 days ago
The Descriptive Complexity of Parity Games
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in th...
Anuj Dawar, Erich Grädel
DCG
1999
93views more  DCG 1999»
13 years 10 months ago
New Maximal Numbers of Equilibria in Bimatrix Games
This paper presents a new lower bound of 2:414d= p d on the maximal number of Nash equilibria in d d bimatrix games, a central concept in game theory. The proof uses an equivalent ...
Bernhard von Stengel
BMCBI
2007
154views more  BMCBI 2007»
13 years 11 months ago
Bounds on the distribution of the number of gaps when circles and lines are covered by fragments: Theory and practical applicati
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
John Moriarty, Julian R. Marchesi, Anthony Metcalf...