Sciweavers

406 search results - page 17 / 82
» Identifying Codes and Covering Problems
Sort
View
CORR
2000
Springer
149views Education» more  CORR 2000»
13 years 8 months ago
On The Closest String and Substring Problems
Abstract. The problem of finding a center string that is "close" to every given string arises in computational molecular biology and coding theory. This problem has two v...
Ming Li, Bin Ma, Lusheng Wang
SBACPAD
2003
IEEE
106views Hardware» more  SBACPAD 2003»
14 years 2 months ago
A Parallel Implementation of the LTSn Method for a Radiative Transfer Problem
— A radiative transfer solver that implements the LTSn method was optimized and parallelized using the MPI message passing communication library. Timing and profiling informatio...
Roberto P. Souto, Haroldo F. de Campos Velho, Step...
ITICSE
2009
ACM
14 years 3 months ago
Software reuse and plagiarism: a code of practice
In general, university guidelines or policies on plagiarism are not sufficiently detailed to cope with the technical complexity of software. Software plagiarism can have a signi...
J. Paul Gibson
MMS
1998
13 years 8 months ago
The Multimedia Multicasting Problem
This paper explores the problems associated with the multicasting of continuous media to support multimedia group applications. The interaction between multicasting and the deliver...
Joseph Pasquale, George C. Polyzos, George Xylomen...
MP
1998
105views more  MP 1998»
13 years 8 months ago
Capacitated facility location: Separation algorithms and computational experience
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
Karen Aardal