Sciweavers

62 search results - page 2 / 13
» A branch-and-bound algorithm for the linear ordering problem...
Sort
View
ASPDAC
1999
ACM
122views Hardware» more  ASPDAC 1999»
13 years 11 months ago
A Clustering Based Linear Ordering Algorithm for K-Way Spectral Partitioning
The spectral method can lead to a high quality of multi-way partition due to its ability to capture global netlist information. For spectral partition, n netlist modules are mappe...
Shiuann-Shiuh Lin, Wen-Hsin Chen, Wen-Wei Lin, Tin...
ICDM
2008
IEEE
128views Data Mining» more  ICDM 2008»
14 years 1 months ago
Cost-Sensitive Parsimonious Linear Regression
We examine linear regression problems where some features may only be observable at a cost (e.g., in medical domains where features may correspond to diagnostic tests that take ti...
Robby Goetschalckx, Kurt Driessens, Scott Sanner
SIGPRO
2010
145views more  SIGPRO 2010»
13 years 2 months ago
Blind identification of MISO-FIR channels
In this paper, we address the problem of determining the order of MISO channels by means of a series of hypothesis tests based on scalar statistics. Using estimated 4th-order outp...
Carlos Estêvão R. Fernandes, Pierre C...
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
14 years 7 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys
AIPS
2008
13 years 9 months ago
Linear Relaxation Techniques for Task Management in Uncertain Settings
In this paper, we consider the problem of assisting a busy user in managing her workload of pending tasks. We assume that our user is typically oversubscribed, and is invariably j...
Pradeep Varakantham, Stephen F. Smith