Sciweavers

14078 search results - page 443 / 2816
» Design and Analysis of Computer Algorithms
Sort
View
WG
2007
Springer
16 years 29 days ago
Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation
Abstract. The computation of all minimal transversals of a given hypergraph in output-polynomial time is a long standing open question known as the transversal hypergraph generatio...
Matthias Hagen
BMCBI
2005
107views more  BMCBI 2005»
15 years 6 months ago
ProbeMaker: an extensible framework for design of sets of oligonucleotide probes
Background: Procedures for genetic analyses based on oligonucleotide probes are powerful tools that can allow highly parallel investigations of genetic material. Such procedures r...
Johan Stenberg, Mats Nilsson, Ulf Landegren
CASES
2003
ACM
16 years 4 days ago
Polynomial-time algorithm for on-chip scratchpad memory partitioning
Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption and die area. The main ...
Federico Angiolini, Luca Benini, Alberto Caprara
AUTOMATICA
2008
115views more  AUTOMATICA 2008»
15 years 7 months ago
Distributed algorithms for reaching consensus on general functions
This paper presents analysis and design results for distributed consensus algorithms in multi-agent networks. We consider continuous consensus functions of the initial state of th...
Jorge Cortés
APIN
2002
113views more  APIN 2002»
15 years 6 months ago
Towards Creative Evolutionary Systems with Interactive Genetic Algorithm
Evolutionary computation has shown a great potential to work out several real-world problems in the point of optimization, but it is still quite far from realizing a system of matc...
Sung-Bae Cho