Sciweavers

3018 search results - page 256 / 604
» Replicating for Performance: Case Studies
Sort
View
JPDC
2006
134views more  JPDC 2006»
15 years 6 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
RE
2006
Springer
15 years 6 months ago
Exposing Tacit Knowledge via Pre-Requirements Tracing
Pre-requirements specification tracing concerns the identification and maintenance of relationships between requirements and the knowledge and information used by analysts to info...
Andrew Stone, Peter Sawyer
IJIEM
2007
78views more  IJIEM 2007»
15 years 6 months ago
Supporting the design of service contracts with interaction models
: A service contract typically specifies the service level, i.e., the quality parameters of the service to be performed. In addition to this static part, there is also the need to ...
Peter Rittgen
WCRE
2010
IEEE
15 years 5 months ago
Extracting Sequence Diagrams from Execution Traces Using Interactive Visualization
—We present a semi-automated approach for the reverse engineering of UML sequence diagrams. Our approach starts with a set of execution traces that are automatically aligned in o...
Hassen Grati, Houari A. Sahraoui, Pierre Poulin
WIOPT
2010
IEEE
15 years 5 months ago
Stochastic modeling of carrier sensing based cognitive radio networks
In this paper, we propose a comprehensive probabilistic framework which can be used to model and analyze cognitive radio (CR) network using carrier sensing (CS) based multiple acc...
Nguyen Tien Viet, François Baccelli