Sciweavers

408 search results - page 23 / 82
» On a stochastic sequencing and scheduling problem
Sort
View
CSB
2004
IEEE
208views Bioinformatics» more  CSB 2004»
14 years 1 months ago
Pair Stochastic Tree Adjoining Grammars for Aligning and Predicting Pseudoknot RNA Structures
Motivation: Since the whole genome sequences for many species are currently available, computational predictions of RNA secondary structures and computational identifications of t...
Hiroshi Matsui, Kengo Sato, Yasubumi Sakakibara
COR
2010
164views more  COR 2010»
13 years 10 months ago
The distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
B. Naderi, Rubén Ruiz
ICNC
2005
Springer
14 years 3 months ago
DNA Computing for Complex Scheduling Problem
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
Mohd Saufee Muhammad, Zuwairie Ibrahim, Satomi Ued...
IJAIT
2008
99views more  IJAIT 2008»
13 years 10 months ago
Optimal Basic Block Instruction Scheduling for Multiple-Issue Processors Using Constraint Programming
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction sch...
Abid M. Malik, Jim McInnes, Peter van Beek
FOCS
2008
IEEE
14 years 4 months ago
The Power of Reordering for Online Minimum Makespan Scheduling
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machi...
Matthias Englert, Deniz Özmen, Matthias Weste...