1071 search results - page 119 / 215 » Programming with enumerable sets of structures |
142
click to vote
HASKELL
2009
ACM
15 years 7 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
114
click to vote
CPHYSICS
2006
15 years 20 days ago
2006
A modification of the standard Simulated Annealing (SA) algorithm is presented for finding the global minimum of a continuous multidimensional, multimodal function. We report resu...
120
click to vote
PLDI
2011
ACM
14 years 3 months ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
106
Voted
BMCBI
2010
15 years 22 days ago
2010
Background: While the pairwise alignments produced by sequence similarity searches are a powerful tool for identifying homologous proteins - proteins that share a common ancestor ...
181
Voted
POPL
2005
ACM
16 years 28 days ago
2005
ACM
Despite the extensiveness of recent investigations on static typing for XML, parametric polymorphism has rarely been treated. This well-established typing discipline can also be u...