Sciweavers

1144 search results - page 49 / 229
» Fractal Algorithm for Finding Global Optimal Solution
Sort
View
DCC
2005
IEEE
16 years 5 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
ICCAD
1999
IEEE
76views Hardware» more  ICCAD 1999»
15 years 10 months ago
Optimal allocation of carry-save-adders in arithmetic optimization
: Carry-save-adder(CSA) is one of the most widely used schemes for fast arithmetic in industry. This paper provides a solution to the problem of finding an optimal-timing allocatio...
Junhyung Um, Taewhan Kim, C. L. Liu
GLVLSI
1996
IEEE
125views VLSI» more  GLVLSI 1996»
15 years 10 months ago
Performance-Driven Interconnect Global Routing
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...
Dongsheng Wang, Ernest S. Kuh
EOR
2006
134views more  EOR 2006»
15 years 6 months ago
A smoothing heuristic for a bilevel pricing problem
In this paper, we provide a heuristic procedure, that performs well from a global optimality point of view, for an important and difficult class of bilevel programs. The algorithm...
Jean-Pierre Dussault, Patrice Marcotte, Séb...
ESA
2008
Springer
83views Algorithms» more  ESA 2008»
15 years 7 months ago
An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
This paper re-examines the classical problem of minimizing maximum lateness which is defined as follows: given a collection of n jobs with processing times and due dates, in what o...
Samir Khuller, Julián Mestre