2005 search results - page 228 / 401 » Decisive Markov Chains |
103
click to vote
SODA
1998
ACM
15 years 3 months ago
1998
ACM
We prove that the First Fit bin packing algorithm is stable under the input distribution U{k - 2, k} for all k 3, settling an open question from the recent survey by Coffman, Gar...
122
click to vote
BIS
2009
15 years 2 months ago
2009
The field of Semantic Business Process Management (SBPM) has refuelled interest in using ontologies for the representation of the static and dynamic aspects of an enterprise and va...
120
click to vote
ATVA
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We define a probabilistic contract framework for the construction of component-based embedded systems, based on the theory of Interactive Markov Chains. A contract specif...
110
Voted
BC
2008
15 years 1 months ago
2008
In this paper we introduce a simple model based on probabilistic finite state automata to describe an emotional interaction between a robot and a human user, or between simulated a...
CORR
2008
Springer
15 years 1 months ago
2008
Springer
As an example of the recently introduced concept of rate of innovation, signals that are linear combinations of a finite number of Diracs per unit time can be acquired by linear fi...