Sciweavers

6105 search results - page 898 / 1221
» A Parallel Algorithm for Bound-Smoothing
Sort
View
ICCAD
1999
IEEE
90views Hardware» more  ICCAD 1999»
15 years 11 months ago
Marsh: min-area retiming with setup and hold constraints
This paper describes a polynomial time algorithm for min-area retiming for edge-triggered circuits to handle both setup and hold constraints. Given a circuit G and a target clock ...
Vijay Sundararajan, Sachin S. Sapatnekar, Keshab K...
145
Voted
IV
1999
IEEE
91views Visualization» more  IV 1999»
15 years 11 months ago
Triangle Mesh Compression for Fast Rendering
Modern GIS(Geographic Information System) application programs and simulation systems have to handle large datasets for rendering. Currently three dimensional rendering hardware a...
Dong-Gyu Park, Yang-Soo Kim, Hwan-Gue Cho
COOPIS
1998
IEEE
15 years 11 months ago
Towards an Inductive Design of Distributed Object Oriented Databases
Cooperative Information Systems (CIS) often consist of applications that access shared resources such as databases. Since centralized systems may have a great impact on the system...
Fernanda Araujo Baião, Marta Mattoso, Gerso...
STOC
1989
ACM
96views Algorithms» more  STOC 1989»
15 years 10 months ago
Optimal Size Integer Division Circuits
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division  nding reciprocals that...
John H. Reif, Stephen R. Tate
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 10 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay