3220 search results - page 212 / 644 » Constrained Graph Processes |
193
click to vote
CLOUD
2010
ACM
15 years 11 months ago
2010
ACM
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...
195
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—Top-k query has long been an important topic in many fields of computer science. Efficient implementation of the top-k queries is the key for information searching. With the n...
281
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
requirement. Furthermore, programming using sequence constructs normally produce nested structures and The current approachfor modeling synchronization in scattered code, especiall...
182
click to vote
ECOOPW
1997
Springer
15 years 10 months ago
1997
Springer
The traditional workflow process model is typically illustrated with a graph of activities, tasks, deliverables and techniques. From an object-oriented perspective, every identifi...
207
click to vote
PE
2011
Springer
15 years 1 months ago
2011
Springer
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...