1686 search results - page 23 / 338 » Programs as polygraphs: computability and complexity |
101
click to vote
JCC
2008
14 years 8 months ago
2008
: The prediction of the binding free energy between a ligand and a protein is an important component in the virtual screening and lead optimization of ligands for drug discovery. T...
ICDE
2011
IEEE
14 years 1 months ago
2011
IEEE
Abstract— In recent years, XML-based Publish-Subscribe Systems have become popular due to the increased demand of timely event-notification. Users (or subscribers) pose complex ...
NCA
2010
IEEE
14 years 4 months ago
2010
IEEE
Programmability is an increasingly important barrier to the deployment of multi-robot systems, as no prior approach allows routine composition and reuse of general aggregate behavi...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
ISSTA
2006
ACM
15 years 3 months ago
2006
ACM
We present a method to verify the correctness of parallel programs that perform complex numerical computations, including computations involving floating-point arithmetic. The me...