The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
We show that the NP-Complete language 3SAT has a PCP verifier that makes two queries to a proof of almost-linear size and achieves sub-constant probability of error o(1). The ver...
Recent advances in hardware and software virtualization offer unprecedented management capabilities for the mapping of virtual resources to physical resources. It is highly desira...
Xiaoyun Zhu, Donald Young, Brian J. Watson, Zhikui...
Creating good adaptation policies is critical to building complex autonomic systems since it is such policies that define the system configuration used in any given situation. W...
Gueyoung Jung, Kaustubh R. Joshi, Matti A. Hiltune...
—The recent surge of peer-to-peer (P2P) networks consisting of thousands of of hosts makes them a breeding ground for malware proliferation. Although some existing studies have s...