Sciweavers

4843 search results - page 371 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
ISPD
1997
ACM
74views Hardware» more  ISPD 1997»
15 years 8 months ago
A matrix synthesis approach to thermal placement
— In this paper, we consider the thermal placement problem for gate arrays. We introduce a new combinatorial optimization problem, matrix synthesis problem (MSP), to model the th...
Chris C. N. Chu, D. F. Wong
JCO
2008
84views more  JCO 2008»
15 years 4 months ago
Partitioning a weighted partial order
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
Linda S. Moonen, Frits C. R. Spieksma
ATMOS
2010
163views Optimization» more  ATMOS 2010»
15 years 3 months ago
Railway Track Allocation by Rapid Branching
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
Ralf Borndörfer, Thomas Schlechte, Steffen We...
ICASSP
2011
IEEE
14 years 8 months ago
Robust binary least squares: Relaxations and algorithms
Finding the least squares (LS) solution s to a system of linear equations Hs = y where H, y are given and s is a vector of binary variables, is a well known NP-hard problem. In th...
Efthymios Tsakonas, Joakim Jalden, Björn E. O...
CVPR
2000
IEEE
16 years 6 months ago
Curve and Surface Reconstruction from Regular and Non-Regular Point Sets
In this paper, we address the problem of curve and surface reconstruction from sets of points. We introduce regular interpolants which are polygonal approximations of planar curve...
Edmond Boyer, Sylvain Petitjean