Sciweavers

10608 search results - page 1863 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
CLEF
2009
Springer
15 years 1 months ago
Interactive Probabilistic Search for GikiCLEF
In this paper we will briefly describe the approaches taken by the Berkeley Cheshire Group for the GikiCLEF task of the QA track. Because the task was intended to model some aspec...
Ray R. Larson
116
Voted
EUROPAR
2010
Springer
15 years 1 months ago
cTrust: Trust Aggregation in Cyclic Mobile Ad Hoc Networks
In a Cyclic Mobile Ad Hoc Network (CMANET) where nodes move cyclically, we formulate trust management problems and propose the cTrust scheme to handle trust establishment and aggre...
Huanyu Zhao, Xin Yang, Xiaolin Li
GISCIENCE
2010
Springer
212views GIS» more  GISCIENCE 2010»
15 years 1 months ago
Qualitative Change to 3-Valued Regions
Regions which evolve over time are a significant aspect of many phenomena in geographic information science. Examples include areas in which a measured value (e.g. temperature, sal...
Matt Duckham, John G. Stell, Maria Vasardani, Mich...
104
Voted
FSTTCS
2008
Springer
15 years 1 months ago
Runtime Monitoring of Metric First-order Temporal Properties
ABSTRACT. We introduce a novel approach to the runtime monitoring of complex system properties. In particular, we present an online algorithm for a safety fragment of metric first...
David A. Basin, Felix Klaedtke, Samuel Müller...
86
Voted
FSTTCS
2008
Springer
15 years 1 months ago
Graph Games on Ordinals
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
Julien Cristau, Florian Horn
« Prev « First page 1863 / 2122 Last » Next »