Sciweavers

2800 search results - page 229 / 560
» Scaling RDF with time
Sort
View
CIKM
2006
Springer
15 years 10 months ago
Approximate reverse k-nearest neighbor queries in general metric spaces
In this paper, we propose an approach for efficient approximative RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our method uses an approx...
Elke Achtert, Christian Böhm, Peer Kröge...
IASTEDSE
2004
15 years 8 months ago
A coordination architecture for time-dependent components
The integration of distributed, data dependent components requires a data synchronisation model. We consider a class of systems where data-dependent components produce data in dis...
Michael N. Barth, Alexander Knapp
IPCO
2004
107views Optimization» more  IPCO 2004»
15 years 8 months ago
A Robust Optimization Approach to Supply Chain Management
Abstract. We propose a general methodology based on robust optimization to address the problem of optimally controlling a supply chain subject to stochastic demand in discrete time...
Dimitris Bertsimas, Aurélie Thiele
IJCAI
2003
15 years 8 months ago
Qualitative Map Learning Based on Co-visibility of Objects
This paper proposes a unique map learning method for mobile robots based on the co-visibility infor­ mation of objects i.e., the information on whether two objects are visible at...
Takehisa Yairi, Koichi Hori
ATAL
2010
Springer
15 years 7 months ago
Laplacian-based consensus on spatial computers
Robotic swarms, like all spatial computers, are a challenging environment for the execution of distributed consensus algorithms due to their scale, diameter, and frequent failures...
Nelson Elhage, Jacob Beal