Let H 2V be a hypergraph on vertex set V . For a positive integer r, we call H r-exact, if any minimal transversal of H intersects any hyperedge of H in at most r vertices. This ...
Solvers on finite domains use local consistency notions to remove values from the domains. This paper defines value withdrawal explanations. Domain reduction is formalized with ch...
In real world processes in the industry or in business, where the elements involved generate data full of noise and biases, improving the energy efficiency represents one of the ma...
Abstract--This paper surveys and unifies a number of recent contributions that have collectively developed a metric for decentralized wireless network analysis known as transmissio...
We present a universal algorithm for the classical online problem of caching or demand paging. We consider the caching problem when the page request sequence is drawn from an unkn...