1480 search results - page 195 / 296 » Distributed algorithms for weighted problems in sparse graph... |
105
click to vote
JACM
2007
15 years 21 days ago
2007
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...
134
click to vote
AAAI
2010
15 years 2 months ago
2010
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...
ISPD
2000
ACM
15 years 5 months ago
2000
ACM
We address the problem of computing critical area for missing material defects in a circuit layout. The extraction of critical area is the main computational problem in VLSI yield...
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
94
Voted
ASPDAC
2009
ACM
15 years 4 months ago
2009
ACM
—Redundant via insertion is a widely recommended technique to enhance the via yield and reliability. In this paper, the post-routing redundant via insertion problem is transforme...