2477 search results - page 166 / 496 » Parallelizing Functional Programs by Generalization |
157
click to vote
PAMI
2007
15 years 4 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
139
Voted
TACAS
2009
Springer
15 years 12 months ago
2009
Springer
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
149
click to vote
AMAI
2006
Springer
15 years 5 months ago
2006
Springer
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
149
click to vote
SIGCSE
2010
ACM
15 years 12 months ago
2010
ACM
Programming exercise assessment tools alleviate the task of teachers, and increase consistency of markings. Many programming exercise assessment tools are based on testing. A test...
166
Voted
ICS
2009
Tsinghua U.
15 years 12 months ago
2009
Tsinghua U.
“Is transactional memory useful?” is the question that cannot be answered until we provide substantial applications that can evaluate its capabilities. While existing TM appli...