1404 search results - page 117 / 281 » Complexity of admissible rules |
134
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
XCS is a stochastic algorithm, so it does not guarantee to produce the same results when run with the same input. When interpretability matters, obtaining a single, stable result ...
120
Voted
HYBRID
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Motivated by three applications which are under investigation at the Honeywell Research Laboratory in Minneapolis, we introduce a class of large scale control problems. I...
129
Voted
ER
2001
Springer
15 years 8 months ago
2001
Springer
In this paper we present an original approach for personalizing complex Web applications, in particular e-commerce applications. This approach is based on a clear separation of con...
137
click to vote
ECAL
1999
Springer
15 years 8 months ago
1999
Springer
In this paper, we present a possible implementation of arithmetic functions (notably, addition and multiplication) using self-replicating cellular automata. The operations are per...
127
Voted
ACSAC
1998
IEEE
15 years 8 months ago
1998
IEEE
The increasing complexity of cellular radio networks yields new demands concerning network security. Especially the task of detecting, repulsing and preventing abuse both by in- a...