Sciweavers

1129 search results - page 141 / 226
» From programming to modeling: our experience with a distribu...
Sort
View
SIGSOFT
2007
ACM
14 years 9 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
HICSS
2000
IEEE
124views Biometrics» more  HICSS 2000»
14 years 16 days ago
An Empirical Study of Distribution based on Voyager: A Performance Analysis
The paper describes the model, implementation and experimental evaluation of a distributed Kohonen Neural Network application (Kohonen Application). The aim of this research is to...
Sérgio Viademonte, Frada Burstein, Fá...
ICSM
2009
IEEE
14 years 3 months ago
A theoretical and empirical study of EFSM dependence
Dependence analysis underpins many activities in software maintenance such as comprehension and impact analysis. As a result, dependence has been studied widely for programming la...
Kelly Androutsopoulos, Nicolas Gold, Mark Harman, ...
SIAMDM
2011
13 years 3 months ago
Stable Roommates Matchings, Mirror Posets, Median Graphs, and the Local/Global Median Phenomenon in Stable Matchings
For stable marriage (SM) and solvable stable roommates (SR) instances, it is known that there are stable matchings that assign each participant to his or her (lower/upper) median ...
Christine T. Cheng, Anhua Lin
POPL
2007
ACM
14 years 9 months ago
Dynamic heap type inference for program understanding and debugging
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
Ben Liblit, Chloë W. Schulze, Marina Polishch...