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...
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...
—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...
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 ...
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...