982 search results - page 146 / 197 » Solving Steiner tree problems in graphs to optimality |
110
Voted
COMPGEOM
1990
ACM
15 years 4 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
95
Voted
TCAD
2008
15 years 13 days ago
2008
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...
114
click to vote
CSCLP
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Many agent coordination problems can be modeled as distributed constraint optimization problems (DCOPs). ADOPT is an asynchronous and distributed search algorithm that is...
119
click to vote
PDP
2003
IEEE
15 years 5 months ago
2003
IEEE
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
120
Voted
ASPDAC
2001
ACM
15 years 4 months ago
2001
ACM
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...