8431 search results - page 1249 / 1687 » Algorithmically Independent Sequences |
177
click to vote
RTCSA
2000
IEEE
15 years 11 months ago
2000
IEEE
A number of industrial applications advocate the use of time-triggered approaches for reasons of predictability, distribution, and particular constraints such as jitter or end-to-...
195
click to vote
CP
2000
Springer
15 years 10 months ago
2000
Springer
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
220
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Continuous time-series sequence matching, specifically, matching a numeric live stream against a set of predefined pattern sequences, is critical for domains ranging from fire spr...
180
click to vote
AAAI
2010
15 years 8 months ago
2010
Planning in large, partially observable domains is challenging, especially when a long-horizon lookahead is necessary to obtain a good policy. Traditional POMDP planners that plan...
204
click to vote
DAGSTUHL
2007
15 years 8 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...