Sciweavers

336 search results - page 16 / 68
» Relevance heuristics for program analysis
Sort
View
MP
1998
109views more  MP 1998»
13 years 7 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
RECOMB
2008
Springer
14 years 8 months ago
De Novo Sequencing of Nonribosomal Peptides
Abstract. While nonribosomal peptides (NRPs) are of tremendous pharmacological importance, there is currently no technology capable of highthroughput sequencing of NRPs. Difficulti...
Nuno Bandeira, Julio Ng, Dario Meluzzi, Roger G. L...
EICS
2009
ACM
14 years 2 months ago
Social network analysis and interactive device design analysis
What methods can we use to help understand why users adopt certain use strategies, and how can we evaluate designs to anticipate and perhaps positively modify how users are likely...
Harold W. Thimbleby, Patrick Oladimeji
CSMR
2005
IEEE
14 years 1 months ago
Applying Webmining Techniques to Execution Traces to Support the Program Comprehension Process
Well-designed object-oriented programs typically consist of a few key classes that work tightly together to provide the bulk of the functionality. As such, these key classes are e...
Andy Zaidman, Toon Calders, Serge Demeyer, Jan Par...
ECOOP
2008
Springer
13 years 9 months ago
Practical Object-Oriented Back-in-Time Debugging
Back-in-time debuggers are extremely useful tools for identifying the causes of bugs. Unfortunately the "omniscient" approaches that try to remember all previous states a...
Adrian Lienhard, Tudor Gîrba, Oscar Nierstra...