Sciweavers

1968 search results - page 126 / 394
» The Complexity of Valued Constraint Models
Sort
View
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
15 years 11 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
ECRTS
2006
IEEE
15 years 7 months ago
A Formal Approach to Multi-Dimensional Sensitivity Analysis of Embedded Real-Time Systems
System robustness is a major concern in the design of efficient and reliable state-of-the-art heterogenous embedded real-time systems. Due to complex component interactions, reso...
Razvan Racu, Arne Hamann, Rolf Ernst
CGI
2004
IEEE
15 years 5 months ago
Using Poxels for Reproducing Traditional Pierced Byzantine Jewellery
We present ByzantineCAD, a feature-based parametric CAD system for designing pierced Byzantine jewellery. ByzantineCAD is an automated system where jewellery is designed according...
Vasiliki Stamati, Ioannis Fudos, Sofia Theodoridou...
POPL
2012
ACM
13 years 9 months ago
A language for automatically enforcing privacy policies
It is becoming increasingly important for applications to protect sensitive data. With current techniques, the programmer bears the burden of ensuring that the application’s beh...
Jean Yang, Kuat Yessenov, Armando Solar-Lezama
ATAL
2011
Springer
14 years 1 months ago
Learning action models for multi-agent planning
In multi-agent planning environments, action models for each agent must be given as input. However, creating such action models by hand is difficult and time-consuming, because i...
Hankz Hankui Zhuo, Hector Muñoz-Avila, Qian...