1450 search results - page 181 / 290 » On the Complexity of Hardness Amplification |
FAST
2009
13 years 7 months ago
2009
Most application provenance systems are hard coded for a particular type of system or data, while current provenance file systems maintain in-memory provenance graphs and reside i...
ICC
2009
IEEE
13 years 7 months ago
2009
IEEE
During the last decade, many works were devoted to improving the performance of relaying techniques in ad hoc networks. One promising approach consists in allowing the relay nodes ...
DISOPT
2011
13 years 4 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
DALT
2010
Springer
13 years 4 months ago
2010
Springer
Social reasoning theories, whilst studied extensively in the area of multiagent systems, are hard to implement directly in agents. They often specify properties of beliefs or behav...
PPL
2010
13 years 4 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...