We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
Chiranjeeb Buragohain, Subhash Suri, Csaba D. T&oa...
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Va...
For molding and casting processes, geometries that have undercut-free parting directions (UFPDs) are preferred for manufacturing. Identifying all UFPDs for arbitrary geometries at ...
In the next generation wireless systems (NGWS) the end user will be able to connect to any of the different available access networks. The end user will also be able to roam seaml...
Kamil H. Suleiman, H. Anthony Chan, Mqhele E. Dlod...