An Efficient Computation of Statistically Critical Sequential Paths Under Retiming

doi 10.1109/aspdac.2007.358043
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IEEE

Related search

Efficient Computation of Minimum Exposure Paths in a Sensor Network Field

English

Efficient Block-Based Parameterized Timing Analysis Covering All Potentially Critical Paths

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
ElectricalSoftwareComputer GraphicsComputer-Aided DesignElectronic Engineering
2012English

Efficient Block-Based Parameterized Timing Analysis Covering All Potentially Critical Paths

2008English

A Methodological Construction of an Efficient Sequential Consistency Protocol

English

Emulation of Scan Paths in Sequential Circuit Synthesis

Informatik-Fachberichte
1991English

Efficient Parallel Computation of PageRank

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Consumption Paths Under Prospect Utility in an Optimal Growth Model

SSRN Electronic Journal
2010English

Tensor Scale: An Analytic Approach With Efficient Computation and Applications

Computer Vision and Image Understanding
Signal ProcessingComputer VisionPattern RecognitionSoftware
2012English

Efficient Computation of Trade-Off Skylines

2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy