264 search results - page 10 / 53 » Time Constraint Patterns for Event B Development |
149
Voted
KDD
2012
ACM
13 years 5 months ago
2012
ACM
Given huge collections of time-evolving events such as web-click logs, which consist of multiple attributes (e.g., URL, userID, timestamp), how do we find patterns and trends? Ho...
118
Voted
PEPM
1994
ACM
15 years 6 months ago
1994
ACM
We present an efficient base algorithm for binding-time analysis based on constraint solving and the union-find algorithm. In practice it has been used to handle all of Standard M...
126
Voted
ASIAN
2004
Springer
15 years 8 months ago
2004
Springer
A central problem in extending the von Neumann architecture to petaflop computers with millions of hardware threads and with a shared memory is defining the memory model [Lam79,...
134
Voted
TCAD
1998
15 years 2 months ago
1998
— We introduce a transformation, named rephasing, that manipulates the timing parameters in control-data-flow graphs (CDFG’s) during the high-level synthesis of data-pathinten...
114
click to vote
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
— Timed Continuous Petri Net (TCPN) systems are piecewise linear models with input constraints that can approximate the dynamical behavior of a class of timed discrete event syst...