Sciweavers

4095 search results - page 587 / 819
» How to test a tree
Sort
View
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
14 years 2 months ago
A destructive evolutionary process: a pilot implementation
This paper describes the application of evolutionary search to the problem of Flash memory wear-out. The operating parameters of Flash memory are notoriously difficult to determin...
Joe Sullivan, Conor Ryan
NOMS
2006
IEEE
169views Communications» more  NOMS 2006»
14 years 2 months ago
Real-Time Measurement of End-to-End Available Bandwidth using Kalman Filtering
—This paper presents a new method, BART (Bandwidth Available in Real-Time), for estimating the end-toend available bandwidth over a network path. It estimates bandwidth quasi-con...
Svante Ekelin, Martin Nilsson, Erik Hartikainen, A...
AGILEDC
2005
IEEE
14 years 1 months ago
Experiences Integrating Sophisticated User Experience Design Practices into Agile Processes
Most significant software processes involve a wide range of disciplines, from programming to testing, and from documentation to database development. Unfortunately, agile processe...
Paul Hodgetts
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
14 years 1 months ago
Tolerant Locally Testable Codes
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
Venkatesan Guruswami, Atri Rudra
ICSE
2010
IEEE-ACM
14 years 1 months ago
From behaviour preservation to behaviour modification: constraint-based mutant generation
The efficacy of mutation analysis depends heavily on its capability to mutate programs in such a way that they remain executable and exhibit deviating behaviour. Whereas the forme...
Friedrich Steimann, Andreas Thies