Given a monic real polynomial with all its roots on the unit circle, we ask to what extent one can perturb its middle coefficient and still have a polynomial with all its roots on ...
Michael J. Mossinghoff, Christopher G. Pinner, Jef...
We consider the following problem for wireless ad hoc networks: assume n nodes, each capable of communicating with nodes within a radius of r, are distributed in a ddimensional re...
Parallel computers can do more than simply speed up sequential computations. They are capable of nding solutions that are far better in quality than those obtained by sequential c...
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
Description logics (DLs) are widely employed in recent semantic web application systems. However, classical description logics are limited when dealing with imprecise concepts and ...