Sciweavers

4438 search results - page 523 / 888
» The Case for Collaborative Programming
Sort
View
STVR
2002
88views more  STVR 2002»
15 years 6 months ago
Empirical studies of test-suite reduction
Test-suite reduction techniques attempt to reduce the costs of saving and reusing test cases during software maintenance by eliminating redundant test cases from test suites. A po...
Gregg Rothermel, Mary Jean Harrold, Jeffery von Ro...
NETWORKS
2010
15 years 5 months ago
Complexity of some inverse shortest path lengths problems
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Tingting Cui, Dorit S. Hochbaum
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
16 years 4 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
SAC
2003
ACM
16 years 21 hour ago
An Initial Investigation of Test Driven Development in Industry
Test Driven Development (TDD) is a software development practice in which unit test cases are incrementally written prior to code implementation. In our research, we ran a set of ...
Boby George, Laurie A. Williams
ICALP
2010
Springer
15 years 11 months ago
Testing Non-uniform k-Wise Independent Distributions over Product Spaces
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
Ronitt Rubinfeld, Ning Xie