Sciweavers

979 search results - page 129 / 196
» Optimal instruction scheduling using integer programming
Sort
View
ICPP
1993
IEEE
14 years 26 days ago
A Concurrent Dynamic Task Graph
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be st...
Theodore Johnson
BIB
2011
13 years 3 months ago
Mutational analysis in RNAs: comparing programs for RNA deleterious mutation prediction
Programs for RNA mutational analysis that are structure-based and rely on secondary structure prediction have been developed and expanded in the past several years. They can be us...
Danny Barash, Alexander Churkin
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
14 years 2 months ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca
DAGSTUHL
2007
13 years 10 months ago
Programming self developing blob machines for spatial computing.
: This is a position paper introducing blob computing: A Blob is a generic primitive used to structure a uniform computing substrate into an easier-to-program parallel virtual mach...
Frédéric Gruau, Christine Eisenbeis
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
14 years 2 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál