Results 1  10
of
2,504
Wireless Communications
, 2005
"... Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University ..."
Abstract

Cited by 1129 (32 self)
 Add to MetaCart
Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University
On globally sparse Ramsey graphs
"... Abstract. We say that a graph G has the Ramsey property w.r.t. some graph F and some integer r ≥ 2, or G is (F, r)Ramsey for short, if any rcoloring of the edges of G contains a monochromatic copy of F. Rödl and Ruciński asked how globally sparse (F, r)Ramsey graphs G can possibly be, where the d ..."
Abstract
 Add to MetaCart
Abstract. We say that a graph G has the Ramsey property w.r.t. some graph F and some integer r ≥ 2, or G is (F, r)Ramsey for short, if any rcoloring of the edges of G contains a monochromatic copy of F. Rödl and Ruciński asked how globally sparse (F, r)Ramsey graphs G can possibly be, where
Classifier fitness based on accuracy
 Evolutionary Computation
, 1995
"... In many classifier systems, the classifier strength parameter serves as a predictor of future payoff and as the classifier’s fitness for the genetic algorithm. We investigate a classifier system, XCS, in which each classifier maintains a prediction of expected payoff, but the classifier’s fitness is ..."
Abstract

Cited by 341 (17 self)
 Add to MetaCart
. Further, XCS tends to evolve classifiers that are maximally general, subject to an accuracy criterion. Besides introducing a new direction for classifier system research, these properties of XCS make it suitable for a wide range of reinforcement learning situations where generalization over states
1Ramsey
"... theory reveals the conditions when sparse coding on subsampled data is unique ..."
Abstract
 Add to MetaCart
theory reveals the conditions when sparse coding on subsampled data is unique
Sharp Thresholds for Certain Ramsey Properties of Random Graphs.
 RANDOM STRUCTURES ALGORITHMS 17 (2000
, 2001
"... In a series of papers culminating in [11] Rödl, Rucinski and others study the thresholds of Ramsey properties of random graphs i.e. for a given graph H , when does a random graph almost surely have the property that for every coloring of its vertices (edges) in r colors there exists a monochromat ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
In a series of papers culminating in [11] Rödl, Rucinski and others study the thresholds of Ramsey properties of random graphs i.e. for a given graph H , when does a random graph almost surely have the property that for every coloring of its vertices (edges) in r colors there exists a
Sharp Thresholds for Ramsey Properties of Random Graphs.
, 1999
"... In a series of papers culminating in [11] Rodl, Ruci'nski and others study the thresholds of Ramsey properties of random graphs and hypergraphs, i.e. for a given graph H , when does a random graph almost surely have the property that for every coloring of its vertices (edges) in r colors th ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In a series of papers culminating in [11] Rodl, Ruci'nski and others study the thresholds of Ramsey properties of random graphs and hypergraphs, i.e. for a given graph H , when does a random graph almost surely have the property that for every coloring of its vertices (edges) in r colors
Threshold functions for asymmetric Ramsey properties with respect to vertex colorings
, 1995
"... We consider the binomial random graph Gn,p and determine a sharp threshold function for the edgeRamsey property Gn,p → (C ℓ1,..., C ℓr) for all ℓ1,..., ℓr, where C ℓ denotes the cycle of length ℓ. As deterministic consequences of our results, we prove the existence of sparse graphs having the above ..."
Abstract

Cited by 22 (9 self)
 Add to MetaCart
We consider the binomial random graph Gn,p and determine a sharp threshold function for the edgeRamsey property Gn,p → (C ℓ1,..., C ℓr) for all ℓ1,..., ℓr, where C ℓ denotes the cycle of length ℓ. As deterministic consequences of our results, we prove the existence of sparse graphs having
Results 1  10
of
2,504