This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...
Many web-based systems have a tiered application architecture, in which a request needs to transverse all the tiers before finishing its processing. One of the most important QoS...
Are computing systems trustworthy? To answer this, we need to know three things: what the systems are supposed to do, what they are not supposed to do, and what they actually do. A...
Relative fitness, or “evaluation by tests” is one of the building blocks of coevolution: the only fitness information available is a comparison with other individuals in a p...
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...