Sciweavers

14235 search results - page 2713 / 2847
» Is computer science science
Sort
View
INTEGRATION
2002
57views more  INTEGRATION 2002»
15 years 3 months ago
To Booth or not to Booth
Booth Recoding is a commonly used technique to recode one of the operands in binary multiplication. In this way the implementation of a multipliers' adder tree can be improve...
Wolfgang J. Paul, Peter-Michael Seidel
IPL
2002
65views more  IPL 2002»
15 years 3 months ago
Parallel evolutionary algorithms can achieve super-linear performance
One of the main reasons for using parallel evolutionary algorithms (PEAs) is to obtain efficient algorithms with an execution time much lower than that of their sequential counter...
Enrique Alba
ISF
2002
132views more  ISF 2002»
15 years 3 months ago
Language/Action Meets Organisational Semiotics: Situating Conversations with Norms
Abstract. Virtual professional communities require a strong coevolution of their social and information systems. To ensure that the evolutionary process of their socio-technical sy...
Aldo de Moor
JACM
2002
94views more  JACM 2002»
15 years 3 months ago
The greedy path-merging algorithm for contig scaffolding
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...
Daniel H. Huson, Knut Reinert, Eugene W. Myers
IJFCS
1998
67views more  IJFCS 1998»
15 years 3 months ago
Vertex Splitting in Dags and Applications to Partial Scan Designs and Lossy Circuits
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni
« Prev « First page 2713 / 2847 Last » Next »