Sciweavers

28888 search results - page 151 / 5778
» Computability and complexity in analysis
Sort
View
ICCAD
1994
IEEE
82views Hardware» more  ICCAD 1994»
14 years 9 days ago
A timing analysis algorithm for circuits with level-sensitive latches
For a logic design with level-sensitive latches, we need to validate timing signal paths which may flush through several latches. We developed efficient algorithms based on the mo...
Jin-fuw Lee, Donald T. Tang, C. K. Wong
CASCON
2006
119views Education» more  CASCON 2006»
13 years 9 months ago
Static analysis for dynamic coupling measures
Coupling measures have important applications in software development and maintenance. They are used to reason about the structural complexity of software and have been shown to p...
Yin Liu, Ana Milanova
GD
2005
Springer
14 years 1 months ago
GEOMI: GEOmetry for Maximum Insight
This paper describes the GEOMI system, a visual analysis tool for the visualisation and analysis of large and complex networks. GEOMI provides a collection of network analysis meth...
Adel Ahmed, Tim Dwyer, Michael Forster, Xiaoyan Fu...
SIGECOM
2006
ACM
142views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
Computing the optimal strategy to commit to
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
Vincent Conitzer, Tuomas Sandholm
DSN
2007
IEEE
14 years 2 months ago
How to Choose a Timing Model?
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
Idit Keidar, Alexander Shraer