2588 search results - page 319 / 518 » Applications of Kolmogorov complexity to computable model th... |
160
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
We show that fixed membership testing for many interesting subclasses of multi-pushdown machines is no harder than for pushdowns with single stack. The models we consider are MVPA...
162
click to vote
FSKD
2007
Springer
16 years 23 days ago
2007
Springer
The selection of web services according to different quality of service (QoS) is one of the most important decision issues for which complex considerations are involved. In many c...
186
click to vote
EUROSYS
2007
ACM
15 years 10 months ago
2007
ACM
As information technology (IT) administration becomes increasingly complex, workflow technologies are gaining popularity for IT automation. Writing correct workflow programs is no...
151
click to vote
ZUM
2000
Springer
15 years 10 months ago
2000
Springer
: Retrenchment is introduced as a liberalisation of refinement intended to address some of the shortcomings of refinement as sole means of progressing from simple abstract models t...
199
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Decentralized Markov decision processes are frequently used to model cooperative multi-agent systems. In this paper, we identify a subclass of general DEC-MDPs that features regul...