Sciweavers

1686 search results - page 26 / 338
» Programs as polygraphs: computability and complexity
Sort
View
65
Voted
ICSE
2009
IEEE-ACM
15 years 4 months ago
WISE: Automated test generation for worst-case complexity
Program analysis and automated test generation have primarily been used to find correctness bugs. We present complexity testing, a novel automated test generation technique to ...
Jacob Burnim, Sudeep Juvekar, Koushik Sen
PPDP
2010
Springer
14 years 8 months ago
Graph queries through datalog optimizations
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
K. Tuncay Tekle, Michael Gorbovitski, Yanhong A. L...
GROUP
2005
ACM
15 years 3 months ago
Pair programming and the re-appropriation of individual tools for collaborative programming
Although pair programming is becoming more prevalent in software development, and a number of reports have been written about it [4] [6], few have addressed the manner in which pa...
Sallyann Bryant, Pablo Romero, Benedict du Boulay
JCC
2011
154views more  JCC 2011»
14 years 16 days ago
Can we trust docking results? Evaluation of seven commonly used programs on PDBbind database
: Docking is one of the most commonly used techniques in drug design. It is used for both identifying correct poses of a ligand in the binding site of a protein as well as for the ...
Dariusz Plewczynski, Michal Lazniewski, Rafal Augu...
ICRA
2010
IEEE
100views Robotics» more  ICRA 2010»
14 years 8 months ago
Weighted barrier functions for computation of force distributions with friction cone constraints
— We present a novel Weighted Barrier Function (WBF) method of efficiently computing optimal grasping force distributions for multifingered hands. Second-order conic friction c...
Per Henrik Borgstrom, Maxim A. Batalin, Gaurav S. ...