Sciweavers

5210 search results - page 235 / 1042
» Exact geometric computation
Sort
View
DAC
1996
ACM
15 years 10 months ago
Espresso-HF: A Heuristic Hazard-Free Minimizer for Two-Level Logic
-- We present a new heuristic algorithm for hazard-free minimization of two-level logic. On nearly all examples, the algorithm finds an exactly minimum-cost cover. It also solves s...
Michael Theobald, Steven M. Nowick, Tao Wu
133
Voted
WG
1992
Springer
15 years 10 months ago
On the Complexity of Partial Order Properties
The recognition complexityof ordered set properties is considered, i.e.how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove ...
Stefan Felsner, Dorothea Wagner
WSC
2007
15 years 9 months ago
Combining network reductions and simulation to estimate network reliability
Network reduction techniques are mainly used with exact approaches such as factoring to compute network reliability. However, exact computation of network reliability is feasible ...
Abdullah Konak
APPML
2006
71views more  APPML 2006»
15 years 6 months ago
Distance distribution of nodes in star graphs
The purpose of the paper is to provide an answer to a long standing problem to compute the distance distribution among the nodes in a star graph, i.e., to compute the exact number...
L. Wang, S. Subramanian, Shahram Latifi, Pradip K....
IPL
2008
95views more  IPL 2008»
15 years 6 months ago
Distortion lower bounds for line embeddings
In this paper, we show how we can derive lower bounds and also compute the exact distortion for the line embeddings of some special metrics, especially trees and graphs with certai...
Claire Mathieu, Charalampos Papamanthou