Sciweavers

74 search results - page 13 / 15
» A note on the size of minimal covers
Sort
View
BMCBI
2008
128views more  BMCBI 2008»
14 years 9 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich
ICCAD
2005
IEEE
144views Hardware» more  ICCAD 2005»
15 years 6 months ago
An exact algorithm for the maximal sharing of partial terms in multiple constant multiplications
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
Paulo F. Flores, José C. Monteiro, Eduardo ...
ICRA
2000
IEEE
109views Robotics» more  ICRA 2000»
15 years 2 months ago
Collaborative Multi-Robot Exploration
In this paper we consider the problem of exploring an unknown environment by a team of robots. As in single-robot exploration the goal is to minimize the overall exploration time....
Wolfram Burgard, Mark Moors, Dieter Fox, Reid G. S...
COCOA
2008
Springer
14 years 11 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth
JGAA
2000
179views more  JGAA 2000»
14 years 9 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao