150 search results - page 19 / 30 » A unifying Framework for Distributed Routing Algorithms |
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Recently, the problem of efficiently supporting advanced query operators, such as nearest neighbor or range queries, over multidimensional data in widely distributed environments...
EUROPAR
2009
Springer
13 years 5 months ago
2009
Springer
Unstructured overlay networks for peer-to-peer applications combined with stochastic algorithms for clustering and resource location are attractive due to low-maintenance costs and...
WETICE
2005
IEEE
14 years 1 months ago
2005
IEEE
The globalization of businesses and the cooperation between organizations have brought on an ever increased need for providing support for distributed collaborations. In this pape...
HICSS
2003
IEEE
14 years 29 days ago
2003
IEEE
This paper uses partially observable Markov decision processes (POMDP’s) as a basic framework for MultiAgent planning. We distinguish three perspectives: first one is that of a...
IS
2011
13 years 2 months ago
2011
In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with ...