5090 search results - page 569 / 1018 » Constructing Strategies for Programming |
167
click to vote
CAP
2010
15 years 1 months ago
2010
How much of existing computer algebra libraries is amenable to automatic parallelization? This is a difficult topic, yet of practical importance in the era of commodity multicore ...
228
click to vote
CPAIOR
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
196
click to vote
FOSSACS
2011
Springer
14 years 10 months ago
2011
Springer
Dependently typed programs contain an excessive amount of static terms which are necessary to please the type checker but irrelevant for computation. To obtain reasonable performan...
234
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
-Preserving Atomicity Abstraction Alexey Gotsman1 and Hongseok Yang2 1 IMDEA Software Institute 2 University of Oxford Modern concurrent algorithms are usually encapsulated in libr...
217
click to vote
JMLR
2012
13 years 9 months ago
2012
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to com...