Sciweavers

3016 search results - page 225 / 604
» The Online Transportation Problem
Sort
View
AMAI
2008
Springer
15 years 6 months ago
The giving tree: constructing trees for efficient offline and online multi-robot coverage
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...
Noa Agmon, Noam Hazon, Gal A. Kaminka
INFOCOM
2012
IEEE
13 years 8 months ago
Estimating age privacy leakage in online social networks
—It is well known that Online Social Networks (OSNs) are vulnerable to privacy leakages, whereby specific information about a user (political affiliation, sexual orientation, g...
Ratan Dey, Cong Tang, Keith W. Ross, Nitesh Saxena
ICDT
2005
ACM
128views Database» more  ICDT 2005»
15 years 11 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
STACS
1999
Springer
15 years 10 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
IMC
2007
ACM
15 years 7 months ago
Acyclic type-of-relationship problems on the internet: an experimental analysis
An experimental study of the feasibility and accuracy of the acyclicity approach introduced in [14] for the inference of business relationships among autonomous systems (ASes) is ...
Benjamin Hummel, Sven Kosub