Sciweavers

5740 search results - page 106 / 1148
» Dynamic Distributed BackJumping
Sort
View
GECCO
2006
Springer
207views Optimization» more  GECCO 2006»
14 years 1 months ago
Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...
Sanyou Y. Zeng, Rui Wang, Hui Shi, Guang Chen, Hug...
ISHPC
2000
Springer
14 years 1 months ago
Automatic Generation of OpenMP Directives and Its Application to Computational Fluid Dynamics Codes
The shared-memory programming model is a very effective way to achieve parallelism on shared memory parallel computers. As great progress was made in hardware and software technolo...
Haoqiang Jin, Michael A. Frumkin, Jerry C. Yan
CONCUR
2008
Springer
13 years 12 months ago
Dynamic Partial Order Reduction Using Probe Sets
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
Harmen Kastenberg, Arend Rensink
PGLDB
2003
151views Database» more  PGLDB 2003»
13 years 11 months ago
Web-service-based, Dynamic and Collaborative E-learning
This paper describes an on-going effort to investigate problems and approaches for achieving Web-service-based, dynamic and collaborative e-learning. In this work, a Learning Cont...
Stanley Y. W. Su, Gilliean Lee
CCGRID
2010
IEEE
13 years 11 months ago
Dynamic TTL-Based Search in Unstructured Peer-to-Peer Networks
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
Imen Filali, Fabrice Huet