Sciweavers

1431 search results - page 205 / 287
» The complexity of random ordered structures
Sort
View
144
Voted
IPPS
2009
IEEE
15 years 10 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader
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...
SMC
2007
IEEE
127views Control Systems» more  SMC 2007»
15 years 9 months ago
Underwater environment reconstruction using stereo and inertial data
Abstract— The underwater environment presents many challenges for robotic sensing including highly variable lighting, the presence of dynamic objects, and the six degree of freed...
Andrew Hogue, Andrew German, Michael Jenkin
116
Voted
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
15 years 9 months ago
A novel ab-initio genetic-based approach for protein folding prediction
In this paper, a model based on genetic algorithms for protein folding prediction is proposed. The most important features of the proposed approach are: i) Heuristic secondary str...
Sergio Raul Duarte Torres, David Camilo Becerra Ro...
151
Voted
SOCO
2007
Springer
15 years 9 months ago
Patterns of Component Evolution
Contemporary software systems are composed of many components, which, in general, undergo phased and incremental development. In order to facilitate the corresponding construction ...
Rajesh Vasa, Markus Lumpe, Jean-Guy Schneider