15033 search results - page 2776 / 3007 » Complexity Theory and Algorithms |
162
click to vote
CLEF
2009
Springer
15 years 6 months ago
2009
Springer
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...
160
click to vote
EUROPAR
2010
Springer
15 years 6 months ago
2010
Springer
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...
147
click to vote
FSTTCS
2008
Springer
15 years 6 months ago
2008
Springer
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...
128
click to vote
FSTTCS
2008
Springer
15 years 6 months ago
2008
Springer
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...
162
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
The study of common, complex multifactorial diseases in genetic epidemiology is complicated by nonlinearity in the genotype-to-phenotype mapping relationship that is due, in part,...