Sciweavers

370 search results - page 35 / 74
» A Meta-Heuristic Based on Simulated Annealing for Solving Mu...
Sort
View
NOMS
2008
IEEE
14 years 2 months ago
A novel approach to bottleneck analysis in networks
—In this paper∗ , we devise a novel method for bottleneck analysis of UDP networks based on the concept of network utility maximization. To determine the losses on the links in...
Nikhil Shetty, Assane Gueye, Jean C. Walrand
FPGA
2010
ACM
359views FPGA» more  FPGA 2010»
14 years 4 months ago
Towards scalable placement for FPGAs
Placement based on simulated annealing is in dominant use in the FPGA community due to its superior quality of result (QoR). However, given the progression of FPGA device capacity...
Huimin Bian, Andrew C. Ling, Alexander Choong, Jia...
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 2 months ago
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
GBRPR
2007
Springer
14 years 1 months ago
Approximating TSP Solution by MST Based Graph Pyramid
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
Yll Haxhimusa, Walter G. Kropatsch, Zygmunt Pizlo,...
SIAMJO
2002
124views more  SIAMJO 2002»
13 years 7 months ago
The Sample Average Approximation Method for Stochastic Discrete Optimization
In this paper we study a Monte Carlo simulation based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and...
Anton J. Kleywegt, Alexander Shapiro, Tito Homem-d...