Sciweavers

1425 search results - page 172 / 285
» Beyond Dependency Graphs
Sort
View
GD
2006
Springer
13 years 12 months ago
On the Decay of Crossing Numbers
The crossing number cr(G) of a graph G is the minimum number of crossings over all drawings of G in the plane. In 1993, Richter and Thomassen [RT93] conjectured that there is a co...
Jacob Fox, Csaba D. Tóth
DSN
2000
IEEE
13 years 11 months ago
Survivability Analysis of Network Specifications
Survivabilityis the ability of a system to maintain a set of essential services despite the presence of abnormal events such as faults and intrusions. Ensuring system survivabilit...
Sanjay K. Jha, Jeannette M. Wing, Richard C. Linge...
ICCAD
1995
IEEE
113views Hardware» more  ICCAD 1995»
13 years 11 months ago
Logic decomposition during technology mapping
—A problem in technology mapping is that the quality of the final implementation depends significantly on the initially provided circuit structure. This problem is critical, es...
Eric Lehman, Yosinori Watanabe, Joel Grodstein, He...
DLT
2006
13 years 9 months ago
Finding Lower Bounds for Nondeterministic State Complexity Is Hard
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
Hermann Gruber, Markus Holzer
ECIS
2003
13 years 9 months ago
Leveraging organizational knowledge to formulate manufacturing strategy
This paper describes a web-based system that integrates knowledge management and decision-making features to enable short-term communities of practice develop manufacturing strate...
Nikos I. Karacapilidis, Emmanuel Adamides, Christi...