1675 search results - page 46 / 335 » The Value of a Good Name |
JMLR
2010
13 years 2 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
IEEEIAS
2009
IEEE
14 years 2 months ago
2009
IEEE
: An algorithm for one-way hash function construction based on conservative chaotic system is proposed. The plaintext is divided into a group of message blocks by a fixed length an...
ISAAC
2004
Springer
14 years 29 days ago
2004
Springer
We consider the problem of dynamically indexing temporal observations about a collection of objects, each observation consisting of a key identifying the object, a list of attribu...
SIAMCO
2008
13 years 7 months ago
2008
We consider the class of nonlinear optimal control problems (OCP) with polynomial data, i.e., the differential equation, state and control constraints and cost are all described by...
TIT
2002
13 years 7 months ago
2002
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is t...