Sciweavers

299 search results - page 12 / 60
» DNA Computing for Complex Scheduling Problem
Sort
View
RSS
2007
126views Robotics» more  RSS 2007»
15 years 1 months ago
Automatic Scheduling for Parallel Forward Dynamics Computation of Open Kinematic Chains
— Recent progress in the algorithm as well as the processor power have made the dynamics simulation of complex kinematic chains more realistic in various fields such as human mo...
Katsu Yamane, Yoshihiko Nakamura
DAWAK
2000
Springer
15 years 4 months ago
COFE: A Scalable Method for Feature Extraction from Complex Objects
Abstract. Feature Extraction, also known as Multidimensional Scaling, is a basic primitive associated with indexing, clustering, nearest neighbor searching and visualization. We co...
Gabriela Hristescu, Martin Farach-Colton
GECCO
2006
Springer
220views Optimization» more  GECCO 2006»
15 years 3 months ago
Comparing evolutionary algorithms on the problem of network inference
In this paper, we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different evoluti...
Christian Spieth, Rene Worzischek, Felix Streicher...
GECCO
2006
Springer
165views Optimization» more  GECCO 2006»
15 years 3 months ago
Comparing mathematical models on the problem of network inference
In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different mathemat...
Christian Spieth, Nadine Hassis, Felix Streichert
JSSPP
2005
Springer
15 years 5 months ago
ScoPred-Scalable User-Directed Performance Prediction Using Complexity Modeling and Historical Data
Using historical information to predict future runs of parallel jobs has shown to be valuable in job scheduling. Trends toward more flexible jobscheduling techniques such as adapt...
Benjamin J. Lafreniere, Angela C. Sodan