Sciweavers

1301 search results - page 171 / 261
» Specifications via Realizability
Sort
View
CLUSTER
2004
IEEE
15 years 7 months ago
An efficient end-host architecture for cluster communication
Cluster computing environments built from commodity hardware have provided a cost-effective solution for many scientific and high-performance applications. Likewise, middleware te...
Xin Qi, Gabriel Parmer, Richard West
ANSOFT
2002
126views more  ANSOFT 2002»
15 years 3 months ago
The Real-Time Process Algebra (RTPA)
Abstract. The real-time process algebra (RTPA) is a set of new mathematical notations for formally describing system architectures, and static and dynamic behaviors. It is recogniz...
Yingxu Wang
BMCBI
2004
101views more  BMCBI 2004»
15 years 3 months ago
A database for G proteins and their interaction with GPCRs
Background: G protein-coupled receptors (GPCRs) transduce signals from extracellular space into the cell, through their interaction with G proteins, which act as switches forming ...
Antigoni L. Elefsinioti, Pantelis G. Bagos, Ioanni...
114
Voted
SIGSOFT
2002
ACM
16 years 4 months ago
Invariant inference for static checking
Static checking can verify the absence of errors in a program, but often requires written annotations or specifications. As a result, static checking can be difficult to use effec...
Jeremy W. Nimmer, Michael D. Ernst
139
Voted
STOC
2006
ACM
174views Algorithms» more  STOC 2006»
16 years 4 months ago
Edge-disjoint paths in Planar graphs with constant congestion
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd