805 search results - page 152 / 161 » Combinatorial optimization problems in self-assembly |
123
Voted
IOR
2008
15 years 3 months ago
2008
This paper develops rare event simulation methods for the estimation of portfolio credit risk -- the risk of losses to a portfolio resulting from defaults of assets in the portfol...
156
Voted
STOC
2009
ACM
16 years 4 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
248
Voted
GIS
2005
ACM
16 years 4 months ago
2005
ACM
Contraflow, or lane reversal, is a way of increasing outbound capacity of a real network by reversing the direction of inbound roads during evacuations. The contraflow is consider...
119
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP) with Genetic Algorithms (GAs). Various improvements ...
145
Voted
STOC
1996
ACM
15 years 7 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...