2490 search results - page 132 / 498 » The Generalized Theory of Model Preference |
145
click to vote
WWW
2008
ACM
16 years 5 months ago
2008
ACM
Because of the high volume and unpredictable arrival rate, stream processing systems may not always be able to keep up with the input data streams-- resulting in buffer overflow a...
148
click to vote
IJAC
2011
14 years 8 months ago
2011
We summarize the main known results involving subword reversing, a method of semigroup theory for constructing van Kampen diagrams by referring to a preferred direction. In good ca...
141
click to vote
AAAI
1998
15 years 5 months ago
1998
When search techniques are used to solve a practical problem, the solution produced is often brittle in the sense that small execution difficulties can have an arbitrarily large e...
128
click to vote
UAI
1989
15 years 5 months ago
1989
In this paper, the feasibility of using finite totally ordered probability models under Aleliunas’s Theory of Probabilistic Logic [Aleliunas, 1988] is investigated. The general...
155
click to vote
FOSSACS
2005
Springer
15 years 10 months ago
2005
Springer
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...