Sciweavers

195 search results - page 26 / 39
» Evolving by Maximizing the Number of Rules: Complexity Study
Sort
View
78
Voted
ICANN
2009
Springer
15 years 2 months ago
Computing with Probabilistic Cellular Automata
Abstract. We investigate the computational capabilities of probabilistic cellular automata by means of the density classification problem. We find that a specific probabilistic ...
Martin Schüle, Thomas Ott, Ruedi Stoop
MCS
2000
Springer
15 years 1 months ago
Combining Fisher Linear Discriminants for Dissimilarity Representations
Abstract Investigating a data set of the critical size makes a classification task difficult. Studying dissimilarity data refers to such a problem, since the number of samples equa...
Elzbieta Pekalska, Marina Skurichina, Robert P. W....
FGCS
2007
125views more  FGCS 2007»
14 years 9 months ago
An autonomic tool for building self-organizing Grid-enabled applications
In this paper we present CAMELotGrid, a tool to manage Grid computations of Cellular Automata that support the efficient simulation of complex systems modeled by a very large numb...
Gianluigi Folino, Giandomenico Spezzano
INFOCOM
2011
IEEE
14 years 1 months ago
Pricing-based spectrum access control in cognitive radio networks with random access
Abstract—Market-based mechanisms offer promising approaches for spectrum access in cognitive radio networks. In this paper, we focus on two market models, one with a monopoly pri...
Lei Yang, Hongseok Kim, Junshan Zhang, Mung Chiang...
RR
2010
Springer
14 years 8 months ago
Defeasibility in Answer Set Programs via Argumentation Theories
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
Hui Wan, Michael Kifer, Benjamin N. Grosof