1480 search results - page 79 / 296 » Distributed algorithms for weighted problems in sparse graph... |
FOCS
2002
IEEE
14 years 3 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
ROBOCUP
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Self-localization in dynamic environments is a central problem in mobile robotics and is well studied in the literature. One of the most popular methods is the Monte Carl...
ICS
2000
Tsinghua U.
14 years 2 months ago
2000
Tsinghua U.
Loop fusion is important to optimizing compilers because it is an important tool in managing the memory hierarchy. By fusing loops that use the same data elements, we can reduce t...
SWAT
1998
Springer
14 years 2 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
TSP
2008
13 years 10 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...