125 search results - page 17 / 25 » An Efficient Heuristic Approach to Solve the Unate Covering ... |
IANDC
2006
13 years 7 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
JACM
2002
13 years 7 months ago
2002
Given a collection of contigs and mate-pairs. The Contig Scaffolding Problem is to order and orientate the given contigs in a manner that is consistent with as many mate-pairs as p...
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
Recent research studied the problem of publishing microdata without revealing sensitive information, leading to the privacy preserving paradigms of k-anonymity and -diversity. k-a...
IJPP
2008
13 years 7 months ago
2008
We present an approach to the analysis and optimisation of heterogeneous multiprocessor embedded systems. The systems are heterogeneous not only in terms of hardware components, b...
CCE
2008
2008
A hierarchical decision procedure for productivity innovation in large-scale petrochemical processes
13 years 7 months ago
Maintaining the best quality is essential for the survival of a company in a globally competitive world. Six Sigma activity has been widely accepted as one of the most efficient a...