Sciweavers

1494 search results - page 118 / 299
» Less Extreme Programming
Sort
View
BMCBI
2007
166views more  BMCBI 2007»
15 years 2 months ago
How to decide which are the most pertinent overly-represented features during gene set enrichment analysis
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...
Roland Barriot, David J. Sherman, Isabelle Dutour
CHI
2011
ACM
14 years 6 months ago
When designing usability questionnaires, does it hurt to be positive?
When designing questionnaires there is a tradition of including items with both positive and negative wording to minimize acquiescence and extreme response biases. Two disadvantag...
Jeff Sauro, James R. Lewis
114
Voted
FM
2009
Springer
124views Formal Methods» more  FM 2009»
15 years 9 months ago
An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method
We present a novel approach to optimize scope-bounded checking programs using a relational constraint solver. Given a program and its correctness specification, the traditional app...
Danhua Shao, Sarfraz Khurshid, Dewayne E. Perry
105
Voted
PLDI
2006
ACM
15 years 8 months ago
An experimental analysis of self-adjusting computation
Dependence graphs and memoization can be used to efficiently update the output of a program as the input changes dynamically. Recent work has studied techniques for combining the...
Umut A. Acar, Guy E. Blelloch, Matthias Blume, Kan...
PLDI
2005
ACM
15 years 8 months ago
Path slicing
We present a new technique, path slicing, that takes as input a possibly infeasible path to a target location, and eliminates all the operations that are irrelevant towards the re...
Ranjit Jhala, Rupak Majumdar