Sciweavers

3220 search results - page 178 / 644
» Constrained Graph Processes
Sort
View
LICS
2009
IEEE
16 years 1 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...
ICDCS
2007
IEEE
16 years 22 days ago
Distributed Resource Management and Admission Control of Stream Processing Systems with Max Utility
A fundamental problem in a large scale decentralized stream processing system is how to best utilize the available resources and admission control the bursty and high volume input...
Cathy H. Xia, Donald F. Towsley, Chun Zhang
MODELS
2010
Springer
15 years 4 months ago
Transforming Process Models: Executable Rewrite Rules versus a Formalized Java Program
Abstract. In the business process management community, transformations for process models are usually programmed using imperative languages (such as Java). The underlying mapping ...
Pieter Van Gorp, Rik Eshuis
ICASSP
2011
IEEE
14 years 10 months ago
A novel algorithm for occlusions and perspective effects using a 3D object process
In this paper, we introduce a novel probabilistic approach to handle occlusions and perspective effects. The proposed method is an object based method embedded in a marked point p...
Ahmed Gamal-Eldin, Xavier Descombes, Josiane Zerub...
ICCAD
2005
IEEE
98views Hardware» more  ICCAD 2005»
16 years 3 months ago
Clustering for processing rate optimization
Clustering (or partitioning) is a crucial step between logic synthesis and physical design in the layout of a large scale design. A design verified at the logic synthesis level m...
Chuan Lin, Jia Wang, Hai Zhou