137 search results - page 20 / 28 » On the number of local minima for the multidimensional assig... |
BIBE
2005
IEEE
14 years 1 months ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
FOCS
2002
IEEE
14 years 18 days ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
ICRA
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— To coordinate a team of robots for exploration is a challenging problem, particularly in large areas as for example the devastated area after a disaster. This problem c...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...