14779 search results - page 30 / 2956 » On Ultrametric Algorithmic Information |
Book
"The aim of this book is to present the strongest possible version of
G¨odel's incompleteness theorem, using an information-theoretic approach
based on the size of com...
IPCO
2010
13 years 10 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
FSKD
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In the artificial neural networks (ANNs), feature selection is a wellresearched problem, which can improve the network performance and speed up the training of the networ...
ESCIENCE
2006
IEEE
14 years 2 months ago
2006
IEEE
Effective scheduling in large-scale computational grids is challenging because it requires tracking the dynamic state of the large number of distributed resources that comprise th...
SEAL
1998
Springer
14 years 21 days ago
1998
Springer
Abstract. In this paper, we discuss an approach to an operator scheduling problem in a large organization over time with the aim of maintaining service quality and reducing total l...