2693 search results - page 239 / 539 » On Computing Complex Navigation Functions |
187
Voted
AAAI
1996
15 years 8 months ago
1996
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
224
click to vote
AINA
2010
IEEE
15 years 5 months ago
2010
IEEE
—This paper describes a method of linearizing the nonlinear characteristics of many sensors using an embedded neural network. The proposed method allows for complex neural networ...
172
click to vote
BIRTHDAY
2010
Springer
15 years 4 months ago
2010
Springer
In [7] Nash, Remmel, and Vianu have raised the question whether a logic L, already introduced by Gurevich in 1988, captures polynomial time, and they give a reformulation of this ...
173
click to vote
TIFS
2010
15 years 1 months ago
2010
Quantitative steganalysis strives to estimate the change rate defined as the relative number of embedding changes introduced by steganography. In this paper, we propose two new cla...
210
click to vote
FOSSACS
2011
Springer
14 years 10 months ago
2011
Springer
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...