A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
Traffic grooming in optical networks has gained significance due to the prevailing sub-wavelength requirement of end users. Optical networks get upgraded to the latest technology s...
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
Abstract--We present a refinement-based compositional framework for showing that pipelined machines satisfy the same safety and liveness properties as their non-pipelined specifica...
A digital control application for the frequency stabilization of optical frequency standards is presented. The standard employed is a monolithic neodymium in yttrium aluminum garn...