Sciweavers

149 search results - page 6 / 30
» Solving large scale combinatorial optimization using PMA-SLS
Sort
View
ICCAD
2000
IEEE
88views Hardware» more  ICCAD 2000»
15 years 4 months ago
DRAGON2000: Standard-Cell Placement Tool for Large Industry Circuits
In this paper, we develop a new standard cell placement tool, Dragon2000, to solve large scale placement problem effectively. A top-down hierarchical approach is used in Dragon200...
Maogang Wang, Xiaojian Yang, Majid Sarrafzadeh
CCE
2006
14 years 11 months ago
An efficient algorithm for large scale stochastic nonlinear programming problems
The class of stochastic nonlinear programming (SNLP) problems is important in optimization due to the presence of nonlinearity and uncertainty in many applications, including thos...
Y. Shastri, Urmila M. Diwekar
IAT
2005
IEEE
15 years 5 months ago
Decomposing Large-Scale POMDP Via Belief State Analysis
Partially observable Markov decision process (POMDP) is commonly used to model a stochastic environment with unobservable states for supporting optimal decision making. Computing ...
Xin Li, William K. Cheung, Jiming Liu
EOR
2011
140views more  EOR 2011»
14 years 3 months ago
Compact bidding languages and supplier selection for markets with economies of scale and scope
Combinatorial auctions have been used in procurement markets with economies of scope. Preference elicitation is already a problem in single-unit combinatorial auctions, but it bec...
Martin Bichler, Stefan Schneider, Kemal Guler, Meh...
JMLR
2006
124views more  JMLR 2006»
14 years 11 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini