Sciweavers

1984 search results - page 172 / 397
» The colourful feasibility problem
Sort
View
AUSAI
2005
Springer
16 years 1 days ago
Adaptive Utility-Based Scheduling in Resource-Constrained Systems
This paper addresses the problem of scheduling jobs in soft real-time systems, where the utility of completing each job decreases over time. We present a utility-based framework fo...
David Vengerov
ESA
2005
Springer
176views Algorithms» more  ESA 2005»
16 years 18 hour ago
On Degree Constrained Shortest Paths
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
Samir Khuller, Kwangil Lee, Mark A. Shayman
CEC
2009
IEEE
15 years 11 months ago
A novel EDAs based method for HP model protein folding
— The protein structure prediction (PSP) problem is one of the most important problems in computational biology. This paper proposes a novel Estimation of Distribution Algorithms...
Benhui Chen, Long Li, Jinglu Hu
AAIM
2010
Springer
181views Algorithms» more  AAIM 2010»
15 years 9 months ago
Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery
Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subseq...
Binhai Zhu
ASPDAC
2008
ACM
86views Hardware» more  ASPDAC 2008»
15 years 8 months ago
An MILP-based wire spreading algorithm for PSM-aware layout modification
Phase shifting mask (PSM) is a promising resolution enhancement technique, which is used in the deep sub-wavelength lithography of the VLSI fabrication process. However, applying ...
Ming-Chao Tsai, Yung-Chia Lin, Ting-Chi Wang