Sciweavers

500 search results - page 45 / 100
» Asynchronous Search with Aggregations
Sort
View
OPODIS
2007
13 years 9 months ago
The Cost of Monotonicity in Distributed Graph Searching
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...
David Ilcinkas, Nicolas Nisse, David Soguet
SEMWEB
2009
Springer
14 years 2 months ago
Towards Lightweight and Robust Large Scale Emergent Knowledge Processing
We present a lightweight framework for processing uncertain emergent knowledge that comes from multiple resources with varying relevance. The framework is essentially RDF-compatibl...
Vít Novácek, Stefan Decker
PDP
2010
IEEE
14 years 2 months ago
Scheduling Metric-Space Queries Processing on Multi-Core Processors
Abstract—This paper proposes a strategy to organize metricspace query processing in multi-core search nodes as understood in the context of search engines running on clusters of ...
Veronica Gil Costa, Ricardo J. Barrientos, Maurici...
FLAIRS
2004
13 years 9 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar
INFOCOM
2010
IEEE
13 years 6 months ago
Information Quality Aware Routing in Event-Driven Sensor Networks
—Upon the occurrence of a phenomenon of interest in a wireless sensor network, multiple sensors may be activated, leading to data implosion and redundancy. Data aggregation and/o...
Hwee-Xian Tan, Mun-Choon Chan, Wendong Xiao, Peng ...