Zobrazeno 1 - 10
of 17
pro vyhledávání: '"George L. Rudolph"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 13, Iss 1, Pp 38-53 (2016)
A k-ranking of a directed graph G is a labeling of the vertex set of G with k positive integers such that every directed path connecting two vertices with the same label includes a vertex with a larger label in between. The rank number of G is define
Externí odkaz:
https://doaj.org/article/b42509a91f8b4a9c8e29e3d565a2d3f3
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 13, Iss 1, Pp 38-53 (2016)
A $k$-ranking of a directed graph $G$ is a labeling of the vertex set of $G$ with $k$ positive integers such that every directed path connecting two vertices with the same label includes a vertex with a larger label in between. The rank number of $G$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8d471f660cf6a488cd077b08330c8136
http://arxiv.org/abs/1702.02142
http://arxiv.org/abs/1702.02142
Publikováno v:
Computational Intelligence. 28:176-208
Reinforcement Programming (RP) is a new approach to automatically generating algorithms that uses reinforcement learning techniques. This paper introduces the RP approach and demonstrates its use to generate a generalized, in-place, iterative sort al
Autor:
George L. Rudolph, Tony Martinez
Publikováno v:
Future Generation Computer Systems. 12:547-564
Most artificial neural networks (ANNs) have a fixed topology during learning, and often suffer from a number of shortcomings as a result. Variations of ANNs that use dynamic topologies have shown ability to overcome many of these problems. This paper
Autor:
Tony Martinez, George L. Rudolph
Publikováno v:
International Journal of Neural Systems. :639-653
Most Artificial Neural Networks (ANNs) have a fixed topology during learning, and often suffer from a number of short-comings as a result. ANNs that use dynamic topologies have shown the ability to overcome many of these problems. Adaptive Self-Organ
Autor:
Tony Martinez, George L. Rudolph
Publikováno v:
International Journal on Artificial Intelligence Tools. :417-427
Most Artificial Neural Networks (ANNs) have a fixed topology during learning, and typically suffer from a number of short-comings as a result. Variations of ANNs that use dynamic topologies have shown ability to overcome many of these problems. This
Publikováno v:
IJCNN
Many learning algorithms have been developed to solve various problems. Machine learning practitioners must use their knowledge of the merits of the algorithms they know to decide which to use for each task. This process often raises questions such a
Publikováno v:
IEEE Congress on Evolutionary Computation
Reinforcement Programming (RP) is a new approach to automatically generating algorithms, that uses reinforcement learning techniques. This paper describes the RP approach and gives results of experiments using RP to generate a generalized, in-place,
Publikováno v:
ACM Southeast Regional Conference
Reinforcement Programming (RP) is a new technique for automatically generating a computer program using reinforcement learning methods. This paper describes how RP learned to generate code for three binary addition problems: simulate a full adder cir
Publikováno v:
ACM Southeast Regional Conference
Consider a situation in which a mobile wireless user needs connectivity to the Internet. One such situation arises in battlefield or at disaster recovery site where it may not be feasible to set up a fixed network. An alternative solution to this pro