Sciweavers

805 search results - page 152 / 161
» Combinatorial optimization problems in self-assembly
Sort
View
IOR
2008
126views more  IOR 2008»
15 years 3 months ago
Fast Simulation of Multifactor Portfolio Credit Risk
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...
Paul Glasserman, Wanmo Kang, Perwez Shahabuddin
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
16 years 4 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
246
Voted
GIS
2005
ACM
16 years 4 months ago
Contraflow network reconfiguration for evacuation planning: a summary of results
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...
Sangho Kim, Shashi Shekhar
GECCO
2005
Springer
182views Optimization» more  GECCO 2005»
15 years 9 months ago
Improving EAX with restricted 2-opt
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 ...
Chen-hsiung Chan, Sheng-An Lee, Cheng-Yan Kao, Hua...
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 7 months ago
Minimum Cuts in Near-Linear Time
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...
David R. Karger