1309 search results - page 141 / 262 » Approaching Optimality for Solving SDD Linear Systems |
113
Voted
ICCD
2003
IEEE
16 years 1 months ago
2003
IEEE
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
128
Voted
PKDD
2009
Springer
15 years 11 months ago
2009
Springer
A frequent problem in density level-set estimation is the choice of the right features that give rise to compact and concise representations of the observed data. We present an e...
116
click to vote
GI
2007
Springer
15 years 10 months ago
2007
Springer
: This paper deals with the linear discrete-time sensor scheduling problem in unreliable communication networks. In case of the common assumption of an errorfree communication, the...
122
click to vote
DATE
2000
IEEE
15 years 9 months ago
2000
IEEE
In this paper, we present an efficient yet accurate inductance extraction methodology and also apply it to clocktree RLC extraction. We first show that without loss of accuracy, t...
134
click to vote
DISOPT
2008
15 years 4 months ago
2008
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...