Sciweavers

2168 search results - page 304 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
GECCO
2009
Springer
15 years 10 months ago
On the scalability of XCS(F)
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
Patrick O. Stalph, Martin V. Butz, David E. Goldbe...
126
Voted
IUI
2006
ACM
15 years 9 months ago
Activity-oriented context-aware adaptation assisting mobile geo-spatial activities
Human geospatial activities often involves the use of geographic information in mobile environment where the context of technology use is dynamic, complex, and unstable, creating ...
Guoray Cai, Yinkun Xue
137
Voted
P2P
2005
IEEE
137views Communications» more  P2P 2005»
15 years 9 months ago
The Essence of P2P: A Reference Architecture for Overlay Networks
The success of the P2P idea has created a huge diversity of approaches, among which overlay networks, for example, Gnutella, Kazaa, Chord, Pastry, Tapestry, P-Grid, or DKS, have r...
Karl Aberer, Luc Onana Alima, Ali Ghodsi, Sarunas ...
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
15 years 7 months ago
The baldwin effect in developing neural networks
The Baldwin Effect is a very plausible, but unproven, biological theory concerning the power of learning to accelerate evolution. Simple computational models in the 1980’s gave...
Keith L. Downing
EOR
2007
102views more  EOR 2007»
15 years 3 months ago
Sub-stochastic matrix analysis for bounds computation - Theoretical results
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
Serge Haddad, Patrice Moreaux