113 search results - page 17 / 23 » When can a graph form an orthogonal polyhedron |
COMSWARE
2006
IEEE
14 years 1 months ago
2006
IEEE
— Development in new radio technologies and increase in user demands are driving the deployment of a wide array of wireless networks, ranging from 802.11 networks in the local ar...
SIAMCOMP
1998
13 years 7 months ago
1998
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
EMSOFT
2006
Springer
13 years 11 months ago
2006
Springer
We present a deadlock avoidance algorithm for distributed systems that guarantees liveness. Deadlock avoidance in distributed systems is a hard problem and general solutions are c...
PASTE
2010
ACM
14 years 13 days ago
2010
ACM
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
IPL
2010
13 years 2 months ago
2010
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...