2157 search results - page 220 / 432 » Optimal Fast Hashing |
124
click to vote
ICCD
2007
IEEE
16 years 27 days ago
2007
IEEE
We present new techniques for explicit constraint satisfaction in the incremental placement process. Our algorithm employs a Lagrangian Relaxation (LR) type approach in the analyt...
140
click to vote
ISQED
2009
IEEE
15 years 10 months ago
2009
IEEE
— This paper revisits and extends a general linear programming(LP) formulation to exploit multiple knobs such as multi-Lgate footprint-compatible libraries and post-layout Lgateb...
149
click to vote
HPCC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The aggregation of objectives in multiple criteria programming is one of the simplest and widely used approach. But it is well known that these techniques sometimes fail ...
141
click to vote
SMA
2005
ACM
15 years 9 months ago
2005
ACM
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
129
click to vote
SIGECOM
2003
ACM
15 years 9 months ago
2003
ACM
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...