3221 search results - page 462 / 645 » Termination of Linear Programs |
196
click to vote
HEURISTICS
1998
15 years 6 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
151
click to vote
JCO
1998
15 years 6 months ago
1998
We consider the problem of scheduling n jobs with release dates on m identical parallel machines to minimize the average completion time of the jobs. We prove that the ratio of the...
146
click to vote
TC
1998
15 years 6 months ago
1998
—When parallel programs are executed on multiprocessors with private caches, a set of data may be repeatedly used and modified by different threads. Such data sharing can often r...
151
click to vote
TIT
2002
15 years 6 months ago
2002
Abstract--We adapt methods originally developed in information and coding theory to solve some testing problems. The efficiency of two-stage pool testing of items is characterized ...
240
click to vote
COCOON
2010
Springer
15 years 5 months ago
2010
Springer
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...