565 search results - page 32 / 113 » A Guided Monte Carlo Approach to Optimization Problems |
STOC
1996
ACM
15 years 2 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
83
Voted
ASPDAC
2010
ACM
14 years 8 months ago
2010
ACM
To cope with an increasing complexity when analyzing analog mismatch in sub-90nm designs, this paper presents a fast non-MonteCarlo method to calculate mismatch in time domain. Th...
IWANN
2005
Springer
15 years 3 months ago
2005
Springer
The Shortest Common Supersequence problem is a hard combinatorial optimization problem with numerous practical applications. Several evolutionary approaches are proposed for this p...
TCAD
2002
14 years 9 months ago
2002
Chemical-mechanical polishing (CMP) and other manufacturing steps in very deep submicron VLSI have varying effects on device and interconnect features, depending on local character...
ICARIS
2003
Springer
15 years 3 months ago
2003
Springer
This paper presents a real-valued negative selection algorithm with good mathematical foundation that solves some of the drawbacks of our previous approach [11]. Specifically, it ...