Sciweavers

2976 search results - page 463 / 596
» On the bounded integer programming
Sort
View
BMCBI
2007
110views more  BMCBI 2007»
13 years 9 months ago
Selection of long oligonucleotides for gene expression microarrays using weighted rank-sum strategy
Background: The design of long oligonucleotides for spotted DNA microarrays requires detailed attention to ensure their optimal performance in the hybridization process. The main ...
Guangan Hu, Manuel Llinás, Jingguang Li, Pe...
INFORMS
2010
138views more  INFORMS 2010»
13 years 7 months ago
Pruning Moves
The concept of dominance among nodes of a branch-decision tree, although known since a long time, is not exploited by general-purpose Mixed-Integer Linear Programming (MILP) enume...
Matteo Fischetti, Domenico Salvagnin
IWCMC
2010
ACM
13 years 7 months ago
Dynamic load balancing and throughput optimization in 3GPP LTE networks
Load imbalance that deteriorates the system performance is a severe problem existing in 3GPP LTE networks. To deal with this problem, we propose in this paper a load balancing fra...
Hao Wang, Lianghui Ding, Ping Wu, Zhiwen Pan, Nan ...
ASPLOS
2009
ACM
14 years 9 months ago
Maximum benefit from a minimal HTM
A minimal, bounded hardware transactional memory implementation significantly improves synchronization performance when used in an operating system kernel. We add HTM to Linux 2.4...
Owen S. Hofmann, Christopher J. Rossbach, Emmett W...
POPL
2008
ACM
14 years 9 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson