Sciweavers

6187 search results - page 1174 / 1238
» Practical Software Measurement
Sort
View
RANDOM
1998
Springer
15 years 7 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
ZUM
1997
Springer
125views Formal Methods» more  ZUM 1997»
15 years 7 months ago
A Formal OO Method Inspired by Fusion and Object-Z
We present a new formal OO method, called FOX, which is a synergetic combination of the semi-formal Fusion method and the formal specification language Object-Z. To manage complex...
Klaus Achatz, Wolfram Schulte
HICSS
1994
IEEE
141views Biometrics» more  HICSS 1994»
15 years 7 months ago
Empirical CATeam Research in Meetings
Meeting research and especially research on Computer Supported Meetings of natural teams is not available in abundance. What is reported of meetings often uses a rather limited th...
Helmut Krcmar, Henrik Lewe, Gerhard Schwabe
PLDI
2010
ACM
15 years 7 months ago
Detecting Inefficiently-Used Containers to Avoid Bloat
Runtime bloat degrades significantly the performance and scalability of software systems. An important source of bloat is the inefficient use of containers. It is expensive to cre...
Guoqing Xu, Atanas Rountev
SIGGRAPH
1993
ACM
15 years 7 months ago
Interval methods for multi-point collisions between time-dependent curved surfaces
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...
John M. Snyder, Adam R. Woodbury, Kurt W. Fleische...
« Prev « First page 1174 / 1238 Last » Next »