5499 search results - page 98 / 1100 » Generalized Rewrite Theories |
134
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
We consider the general, widely applicable problem of selecting from n real-valued random variables a subset of size m of those with the highest means, based on as few samples as ...
111
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
Multisource information theory in Shannon setting is well known. In this article we try to develop its algorithmic information theory counterpart and use it as the general framewo...
132
click to vote
COMPSAC
2002
IEEE
15 years 9 months ago
2002
IEEE
The problem of testing from an extended finite state machine (EFSM) is complicated by the presence of infeasible paths. This paper considers the problem of expanding an EFSM in o...
136
click to vote
DEXA
1993
Springer
15 years 8 months ago
1993
Springer
We describe an integration of the hypermedia system HyperPATH with the object-oriented DBMS (OODBMS) O¡ . Providing persistence to a hypertext system was the first motivation of...
105
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We are concerned with demonstrating productivity of specifications of infinite streams of data, based on orthogonal rewrite rules. In general, this property is undecidabl...