5372 search results - page 924 / 1075 » complexity 2007 |
141
click to vote
DAGSTUHL
2007
15 years 5 months ago
2007
iary models in order to bridge the semantic gap between high-level, abstract user requirements and low-level, concrete programs and to support a stepwise refinement process. This d...
164
click to vote
DAGSTUHL
2007
15 years 5 months ago
2007
Abstract. In this paper, we consider the problem of filtering in relational hidden Markov models. We present a compact representation for such models and an associated logical par...
161
click to vote
DAGSTUHL
2007
15 years 5 months ago
2007
Computational social choice is an interdisciplinary eld of study at the interface of social choice theory and computer science, with knowledge owing in either direction. On the o...
169
click to vote
DAGSTUHL
2007
15 years 5 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
159
click to vote
DAIS
2007
15 years 5 months ago
2007
Constructing and executing distributed applications that can adapt to their current operating context, in order to maintain or enhance Quality of Service (QoS) attribute levels, ar...