Sciweavers

1054 search results - page 69 / 211
» Capacitated Domination Problem
Sort
View
CORR
2010
Springer
137views Education» more  CORR 2010»
15 years 6 months ago
Local algorithms in (weakly) coloured graphs
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
Matti Åstrand, Valentin Polishchuk, Joel Ryb...
SNPD
2007
15 years 7 months ago
Localized Flooding Backbone Construction for Location Privacy in Sensor Networks
Source and destination location privacy is a challenging and important problem in sensor networks. Nevertheless, privacy preserving communication in sensor networks is still a vir...
Yingchang Xiang, Dechang Chen, Xiuzhen Cheng, Kai ...
TCS
2008
15 years 6 months ago
Comparing evolutionary algorithms to the (1+1)-EA
In this paper, we study the conditions in which the (1+1)-EA compares favorably to other evolutionary algorithms (EAs) in terms of fitness function distribution at given iteration...
Pavel A. Borisovsky, Anton V. Eremeev
PVLDB
2010
116views more  PVLDB 2010»
15 years 28 days ago
Computing Closed Skycubes
In this paper, we tackle the problem of efficient skycube computation. We introduce a novel approach significantly reducing domination tests for a given subspace and the number of...
Chedy Raïssi, Jian Pei, Thomas Kister
ESA
2009
Springer
124views Algorithms» more  ESA 2009»
16 years 23 days ago
Minimum Makespan Multi-vehicle Dial-a-Ride
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi