Sciweavers

708 search results - page 83 / 142
» Timing closure: the solution and its problems
Sort
View
83
Voted
VLSID
1998
IEEE
116views VLSI» more  VLSID 1998»
15 years 2 months ago
Synthesis of Testable RTL Designs
With several commercial tools becoming available, the high-level synthesis of applicationspeci c integrated circuits is nding wide spread acceptance in VLSI industry today. Existi...
C. P. Ravikumar, Sumit Gupta, Akshay Jajoo
ALGORITHMICA
2007
86views more  ALGORITHMICA 2007»
14 years 10 months ago
Detecting Holes and Antiholes in Graphs
In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices ...
Stavros D. Nikolopoulos, Leonidas Palios
CORR
2010
Springer
86views Education» more  CORR 2010»
14 years 10 months ago
Online Scheduling on Identical Machines using SRPT
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
Kyle Fox, Benjamin Moseley
FAST
2009
14 years 7 months ago
Provenance as Data Mining: Combining File System Metadata with Content Analysis
Provenance describes how an object came to be in its present state. Thus, it describes the evolution of the object over time. Prior work on provenance has focussed on databases an...
Vinay Deolalikar, Hernan Laffitte
MTA
2007
79views more  MTA 2007»
14 years 9 months ago
Periodic broadcast with dynamic server selection
Abstract—Service replication is an effective way to address resource requirements and resource availability problem. Dynamic service selection enables clients to choose a server ...
Ewa Kusmierek, Yingping Lu, David Hung-Chang Du