Back to Results
First PageMeta Content
Higher-order functions / Lambda calculus / Functional programming / Recursion / Procedural programming languages / Combinatory logic / Fold / Dynamic programming / Map / Software engineering / Computing / Computer programming


Sneaking Around concatMap Efficient Combinators for Dynamic Programming Christian H¨oner zu Siederdissen Institute for Theoretical Chemistry, University of Vienna, 1090 Wien, Austria
Add to Reading List

Document Date: 2012-07-04 05:49:20


Open Document

File Size: 227,96 KB

Share Result on Facebook

City

Wien / Copenhagen / /

Company

Intel / /

Country

Austria / Denmark / /

Currency

USD / GHS / ADP / /

/

Facility

terminal We / Siederdissen Institute / University of Vienna / ADPfusion library / /

IndustryTerm

energy tables / problematic device / elegant device / state-of-theart software / dynamic programming algorithm / minimum-free energy prediction part / algebra products / example algorithm / search space using annotation / typical dynamic programming algorithm / search space / algebra product / algorithms algorithm / elegant algebra product device / energy / /

NaturalFeature

Efficient stream / Efficient streams / /

Organization

African Union / University of Vienna / U.S. Securities and Exchange Commission / Institute for Theoretical Chemistry / /

Position

Optimization General / designer / good representative / Major / production lead / programmer / /

ProgrammingLanguage

Haskell / C / /

Technology

functional programming / RAM / The Nussinov78 algorithm / bioinformatics / CYK algorithm / Both algorithms / two algorithms algorithm / dynamic programming algorithm / example algorithm / algorithm The algorithm / second algorithm / DP algorithms / DSL / DP algorithm / 2.0 algorithm / typical dynamic programming algorithm / Nussinov78 algorithm / offered algorithms / /

URL

http /

SocialTag