- Full text PDF available (5)
A parallelizable SSOR preconditioning scheme for Krylov subspace iterative solvers in lattice QCD applications involving Wilson fermions is presented. In actual Hybrid Monte Carlo simulations and quark propagator calculations it helps to reduce the number of iterations by a factor of 2 compared to conventional odd-even preconditioning. This corresponds to a… (More)
In this paper we study an idealized model of load balancing for dynamic spectrum allocation (DSA) for secondary users using only local information. In our model, each agent is assigned to a channel and may reassign its load in a round based fashion. We present a randomized protocol in which the actions of the agents depend purely on some cost measure (e.… (More)
We study witness-isomorphic reductions, a type of structure-preserving reduction between NP decision problems. We completely determine the relative power of the diierent models of witness-isomorphic reduction, and we show that witness-isomorphic reductions can be used in a uniform approach to the local search problem.
We prove that the local search optimization problem TSP 2Opt |though not known to be PLS-complete|shares an important infeasibility property with other PLS-complete sets.
We study witness-isomorphic reductions, a type of structure-preserving reduction between NP-decision problems. We show that witness-isomorphic reductions can be used in a uniform approach to the local search problem