2850 search results - page 384 / 570 » On Timed Models and Full Abstraction |
162
click to vote
INFOCOM
2000
IEEE
15 years 11 months ago
2000
IEEE
Abstract—A challenging aspect of mobile communications consists in exploring ways in which the available run time of terminals can be maximized. In this paper, we present a detai...
182
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
Abstract. In recent years, there has been a surge of interest in Javabased volunteer computing systems, which aim to make it possible to build very large parallel computing network...
176
click to vote
KDD
1999
ACM
15 years 11 months ago
1999
ACM
Abstract. We propose a data mining model that captures the user navigation behaviour patterns. The user navigation sessions are modelled as a hypertext probabilistic grammar whose ...
173
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
180
click to vote
BPM
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a ...