Sciweavers

268 search results - page 51 / 54
» Using Second Life in Programming's Communities of Practice
Sort
View
ICFP
2005
ACM
14 years 7 months ago
High-level views on low-level representations
This paper explains how the high-level treatment of datatypes in functional languages--using features like constructor functions and pattern matching--can be made to coexist with ...
Iavor S. Diatchki, Mark P. Jones, Rebekah Leslie
ISSTA
2012
ACM
11 years 9 months ago
Swarm testing
Swarm testing is a novel and inexpensive way to improve the diversity of test cases generated during random testing. Increased diversity leads to improved coverage and fault detec...
Alex Groce, Chaoqiang Zhang, Eric Eide, Yang Chen,...
IMC
2007
ACM
13 years 9 months ago
On optimal probing for delay and loss measurement
Packet delay and loss are two fundamental measures of performance. Using active probing to measure delay and loss typically involves sending Poisson probes, on the basis of the PA...
François Baccelli, Sridhar Machiraju, Darry...
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
13 years 7 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
ICSEA
2007
IEEE
14 years 1 months ago
A Model for the Effect of Caching on Algorithmic Efficiency in Radix based Sorting
— This paper demonstrates that the algorithmic performance of end user programs may be greatly affected by the two or three level caching scheme of the processor, and we introduc...
Arne Maus, Stein Gjessing