3750 search results - page 230 / 750 » Timed Automata Patterns |
172
click to vote
IEICET
2008
15 years 6 months ago
2008
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered...
176
click to vote
AOSD
2008
ACM
15 years 8 months ago
2008
ACM
In a software product line, the binding time of a feature is the time at which one decides to include or exclude a feature from a product. Typical binding site implementations are...
173
click to vote
RTCSA
2006
IEEE
16 years 18 days ago
2006
IEEE
This article introduces the concept of monotonic transactions. A monotonic transaction is a particular case of transactions for which the load arrival pattern is (or can be by rot...
195
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
153
click to vote
HOTOS
1999
IEEE
15 years 11 months ago
1999
IEEE
Most modern I/O systems treat each file access independently. However, events in a computer system are driven by programs. Thus, accesses to files occur in consistent patterns and...