Results 1  10
of
223
NTuple of Helices
"... • Definition: As a generalization of a biological double helix and an institutional triple helix, the ntuple of helices is based on Luhmann’s distinction of symbolically generalized media and codes of communication that can be functionally differentiated as the economy, polity, science, etc. • Cros ..."
Abstract
 Add to MetaCart
• Definition: As a generalization of a biological double helix and an institutional triple helix, the ntuple of helices is based on Luhmann’s distinction of symbolically generalized media and codes of communication that can be functionally differentiated as the economy, polity, science, etc
Criticality Dispersion in Swarms to Optimize Ntuples
"... ABSTRACT Among numerous pattern recognition methods the neural network approach has been the subject of much research due to its ability to learn from a given collection of representative examples. This paper concerns with the optimization of a weightless neural network, which decomposes a given pa ..."
Abstract
 Add to MetaCart
pattern into several sets of n points, termed ntuples. A populationbased stochastic optimization technique, known as Particle Swarm Optimization (PSO), has been used to select an optimal set of connectivity patterns to improve the recognition performance of such "ntuple" classifiers
Learning Ntuple Networks for Othello by Coevolutionary Gradient Search
"... We propose Coevolutionary Gradient Search, a blueprint for a family of iterative learning algorithms that combine elements of local search and populationbased search. The approach is applied to learning Othello strategies represented as ntuple networks using different search operators and modes ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We propose Coevolutionary Gradient Search, a blueprint for a family of iterative learning algorithms that combine elements of local search and populationbased search. The approach is applied to learning Othello strategies represented as ntuple networks using different search operators and modes
Temporal difference learning of ntuple networks for the game 2048
 In Proceedings of the IEEE Conference on Computational Intelligence and Games
, 2014
"... Abstract—The highly addictive stochastic puzzle game 2048 has recently invaded the Internet and mobile devices, stealing countless hours of players ’ lives. In this study we investigate the possibility of creating a gameplaying agent capable of winning this game without incorporating human expertis ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
expertise or performing game tree search. For this purpose, we employ three variants of temporal difference learning to acquire i) action value, ii) state value, and iii) afterstate value functions for evaluating player moves at 1ply. To represent these functions we adopt ntuple networks, which have
1.1 The Common Prior Assumption
, 2007
"... zivyahel @ gmail.com 1 Abstract. Abandoning the oftpresumed common prior assumption, partitioned type spaces with disparate priors are studied. It is shown that in the twoplayer case, a unique fundamental pair of priors ( 1, 2) p p can be identified in each type space, from whose properties bounda ..."
Abstract
 Add to MetaCart
pair of priors is a special case of the nplayer situation, where a representative ntuple of fundamentally associated priors 0 n−1 p,..., p) can be selected, out of at most n −1 such ntuples, to play an analogous role.
Public Quadratic PolynomialTuples for Efficient SignatureVerification and MessageEncryption
, 1998
"... This paper discusses an asymmetric cryptosystem C* which consists of public transformations of compleyJty O(m2n 3) and secret transformations of complexity O((mn)2(m + logn)), where each complex ity is measured in the total number of bitoperations for processing an ranbit message block. Each publ ..."
Abstract

Cited by 123 (1 self)
 Add to MetaCart
public key of C* is an ntuple of quadratic nvariate polynomials over GF(2'") and can be used for both verifying signatures and encrypting plaintexts. This paper also shows that for C* it is practically infeasible to extract the ntuple of nvariate polynomials representing the inverse
Operator tuples and analytic models over general domains in C n
 Multidim Syst Sign Process (2007) 18:191–248 Arazy
, 2002
"... Abstract. For a class of Hilbert spaces H of functions analytic on a domain D ⊂ C n, we characterize the ntuples T of commuting Hilbert space operators which can be represented by means of multiplications by the coordinate functions on H. In case H is a subspace of some L 2space we thus obtain for ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
Abstract. For a class of Hilbert spaces H of functions analytic on a domain D ⊂ C n, we characterize the ntuples T of commuting Hilbert space operators which can be represented by means of multiplications by the coordinate functions on H. In case H is a subspace of some L 2space we thus obtain
Representing polynomials by positive linear functions on compact convex polyhedra
 Pacific Journal of Mathematics
, 1988
"... If K is a compact polyhedron in Euclidean έ/space, defined by linear inequalities, βt> 0, and if / is a polynomial in d variables that is strictly positive on AT, then / can be expressed as a positive linear combination of products of members of {/?,}. In proving this and subsidiary results, we ..."
Abstract

Cited by 43 (0 self)
 Add to MetaCart
){βi)~~ι{[0,oo)) is compact and has interior. Let / be a polynomial in the d variables with entries from L, such that the restriction, f\K, is strictly positive. Then our first result (1.3) asserts that / may be represented as a combination with coefficients from L n R+ (that is, positive numbers in L
Representing Topological Structures Using CellChains
, 2006
"... A new topological representation of surfaces in higher dimensions, “cellchains ” is developed. The representation is a generalization of Brisson’s celltuple data structure. Cellchains are identical to celltuples when there are no degeneracies: cells or simplices with identified vertices. The pr ..."
Abstract
 Add to MetaCart
. The proof of correctness is based on axioms true for maps, such as those in Brisson’s celltuple representation. A critical new condition (axiom) is added to those of Lienhardt’s nGmaps to give “cellmaps”. We show that cellmaps and cellchains characterize the same topological representations.
Constraint Satisfaction Via Partially Parallel Propagation Steps
, 1992
"... to variables according to existing constraints. Given n variables with ntuples which represents the globally consistent solution. This article presents a parallel approach to global constraint satisfaction. 0 ..."
Abstract
 Add to MetaCart
to variables according to existing constraints. Given n variables with ntuples which represents the globally consistent solution. This article presents a parallel approach to global constraint satisfaction. 0
Results 1  10
of
223