Sciweavers

5606 search results - page 612 / 1122
» Randomization Techniques for Graphs.
Sort
View
CONCUR
2000
Springer
15 years 10 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
SPATIALCOGNITION
2000
Springer
15 years 10 months ago
Inference and Visualization of Spatial Relations
We present an approach to spatial inference which is based on the procedural semantics of spatial relations. In contrast to qualitative reasoning, we do not use discrete symbolic m...
Sylvia Wiebrock, Lars Wittenburg, Ute Schmid, Frit...
ISLPED
1995
ACM
100views Hardware» more  ISLPED 1995»
15 years 10 months ago
Simultaneous scheduling and binding for power minimization during microarchitecture synthesis
ABSTRACT { Sub-micron technologies and the increasing size and complexity of integrated components have aggravated the e ect of long interconnects and buses, compared to that of ga...
Aurobindo Dasgupta, Ramesh Karri
CSR
2010
Springer
15 years 10 months ago
A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem
Abstract. The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. While thorough theoretical and experimental analyses have been ...
Gerold Jäger, Weixiong Zhang
BIRD
2008
Springer
163views Bioinformatics» more  BIRD 2008»
15 years 9 months ago
Multi-functional Protein Clustering in PPI Networks
Abstract. Protein-Protein Interaction (PPI) networks contain valuable information for the isolation of groups of proteins that participate in the same biological function. Many pro...
Clara Pizzuti, Simona E. Rombo