Sciweavers

299 search results - page 19 / 60
» DNA Computing for Complex Scheduling Problem
Sort
View
WSC
2004
15 years 1 months ago
An Event Graph Based Simulation and Scheduling Analysis of Multi-Cluster Tools
Simulation methods are extensively used in modeling complex scheduling problems. However, traditional layout of simulation models can become complicated when they are used to find...
Shengwei Ding, Jingang Yi
BMCBI
2006
100views more  BMCBI 2006»
14 years 11 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
ICIP
2003
IEEE
16 years 1 months ago
Non-linear 3D rendering workload prediction based on a combined fuzzy-neural network architecture for grid computing application
Although, computational Grid has been initially developed to solve large-scale scientific research problems, it is extended for commercial and industrial applications. An interest...
John K. Doulamis, Anastasios D. Doulamis
HICSS
2003
IEEE
200views Biometrics» more  HICSS 2003»
15 years 5 months ago
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
Yang Wang 0006, Thomas Kunz
EUROPAR
2006
Springer
15 years 3 months ago
Multi-dimensional Kernel Generation for Loop Nest Software Pipelining
Single-dimension Software Pipelining (SSP) has been proposed as an effective software pipelining technique for multi-dimensional loops [16]. This paper introduces for the first tim...
Alban Douillet, Hongbo Rong, Guang R. Gao