We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
In this paper we propose to use a distance metric based on user-preferences to efficiently find solutions for manyobjective problems. We use a particle swarm optimization (PSO) a...
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
Different solvers for computationally difficult problems such as satisfiability (SAT) perform best on different instances. Algorithm portfolios exploit this phenomenon by predicti...