Sciweavers

2850 search results - page 457 / 570
» On Timed Models and Full Abstraction
Sort
View
IUI
2012
ACM
13 years 8 months ago
Automatic reverse engineering of interactive dynamic web applications to support adaptation across platforms
The effort and time required to develop user interface models has been one of the main limitations to the adoption of model-based approaches, which enable intelligent processing o...
Federico Bellucci, Giuseppe Ghiani, Fabio Patern&o...
119
Voted
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
15 years 7 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
104
Voted
ISCAS
2006
IEEE
146views Hardware» more  ISCAS 2006»
15 years 6 months ago
XML-based customization along the scalability axes of H.264/AVC scalable video coding
Abstract— The heterogeneity in the current and future multimedia environment requires an elegant adaptation framework for the production and consumption of different kinds of mul...
Davy De Schrijver, Wesley De Neve, Koen De Wolf, S...
108
Voted
SIGSOFT
2006
ACM
15 years 6 months ago
Simulation-based test adequacy criteria for distributed systems
Developers of distributed systems routinely construct discrete-event simulations to help understand and evaluate the behavior of inter-component protocols. Simulations are abstrac...
Matthew J. Rutherford, Antonio Carzaniga, Alexande...
STACS
1999
Springer
15 years 5 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann