Sciweavers

1182 search results - page 46 / 237
» Reducing the Overhead of Dynamic Analysis
Sort
View
DATE
2005
IEEE
93views Hardware» more  DATE 2005»
14 years 3 months ago
A Faster Counterexample Minimization Algorithm Based on Refutation Analysis
It is a hot research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. The BFL algorithm is the most effective counterexample minimi...
ShengYu Shen, Ying Qin, Sikun Li
PADS
2004
ACM
14 years 3 months ago
Event Reconstruction in Time Warp
In optimistic simulations, checkpointing techniques are often used to reduce the overhead caused by state saving. In this paper, we propose event reconstruction as a technique wit...
Lijun Li, Carl Tropper
WCRE
2010
IEEE
13 years 8 months ago
Immediacy through Interactivity: Online Analysis of Run-time Behavior
—Visualizations of actual run-time data support the comprehension of programs, like examples support the ion of abstract concepts and principles. Unfortunately, the required run-...
Michael Perscheid, Bastian Steinert, Robert Hirsch...
VLSID
2004
IEEE
142views VLSI» more  VLSID 2004»
14 years 10 months ago
Dynamic Noise Margin: Definitions and Model
Dynamic noise analysis is greatly needed in place of traditional static noise analysis due to the ever increasingly stringent design requirement for VLSI chips based on very deep ...
Li Ding 0002, Pinaki Mazumder
BROADNETS
2005
IEEE
14 years 3 months ago
Performance analysis and enhancement for backbone based wireless mobile ad hoc networks
—In this paper, we present an extended Mobile Backbone Network (MBN) topology synthesis algorithm (ETSA) for constructing and maintaining a dynamic backbone structure in mobile w...
Laura Huei-jiun Ju, Izhak Rubin