Sciweavers

148 search results - page 23 / 30
» Analysis of Multilevel Graph Partitioning
Sort
View
CDC
2008
IEEE
119views Control Systems» more  CDC 2008»
13 years 9 months ago
Formal analysis of timed continuous Petri nets
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (contPN). Specifically, we consider two problems: (1) given an initial set o...
Marius Kloetzer, Cristian Mahulea, Calin Belta, La...
BIRTHDAY
2005
Springer
14 years 1 months ago
Expander2
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or co...
Peter Padawitz
PPOPP
2012
ACM
12 years 3 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
ICCAD
1999
IEEE
115views Hardware» more  ICCAD 1999»
13 years 11 months ago
Fast performance analysis of bus-based system-on-chip communication architectures
This paper addresses the problem of efficient and accurate performance analysis to drive the exploration and design of bus-based System-on-Chip (SOC) communication architectures. ...
Kanishka Lahiri, Anand Raghunathan, Sujit Dey
BMCBI
2007
118views more  BMCBI 2007»
13 years 7 months ago
A topological algorithm for identification of structural domains of proteins
Background: Identification of the structural domains of proteins is important for our understanding of the organizational principles and mechanisms of protein folding, and for ins...
Frank Emmert-Streib, Arcady R. Mushegian