Sciweavers

2584 search results - page 236 / 517
» On the Forward Checking Algorithm
Sort
View
TCAD
1998
86views more  TCAD 1998»
15 years 2 months ago
Fast heuristic and exact algorithms for two-level hazard-free logic minimization
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
Michael Theobald, Steven M. Nowick
ICCAD
2009
IEEE
106views Hardware» more  ICCAD 2009»
15 years 23 days ago
An efficient pre-assignment routing algorithm for flip-chip designs
The flip-chip package is introduced for modern IC designs with higher integration density and larger I/O counts. In this paper, we consider the pre-assignment flip-chip routing pr...
Po-Wei Lee, Chung-Wei Lin, Yao-Wen Chang, Chin-Fan...
BIRTHDAY
2011
Springer
14 years 3 months ago
Algorithmic Aspects of Risk Management
Abstract. Risk analysis has been used to manage the security of systems for several decades. However, its use has been limited to offline risk computation and manual response. In c...
Ashish Gehani, Lee Zaniewski, K. Subramani
WG
2005
Springer
15 years 8 months ago
Hypertree Decompositions: Structure, Algorithms, and Applications
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
Georg Gottlob, Martin Grohe, Nysret Musliu, Marko ...
RTCSA
1998
IEEE
15 years 7 months ago
Wait-Free Snapshots in Real-Time Systems: Algorithms and Performance
Snap-shot mechanisms are used to read a globally consistent set of variable values. Such a mechanism can be used to solve a variety of communication and synchronization problems, ...
Andreas Ermedahl, Hans Hansson, Marina Papatrianta...