1805 search results - page 190 / 361 » Functional programming with structured graphs |
128
click to vote
ERSHOV
2003
Springer
15 years 6 months ago
2003
Springer
By obfuscation we mean any efficient semantic-preserving transformation of computer programs aimed at bringing a program into such a form, which impedes the understanding of its al...
104
click to vote
AI
2000
Springer
15 years 1 months ago
2000
Springer
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
122
click to vote
ORL
2000
15 years 1 months ago
2000
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
ICFEM
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. Verification of programs with invocations to unknown procedures is a practical problem, because in many scenarios not all codes of programs to be verified are available...
111
click to vote
IPPS
1999
IEEE
15 years 5 months ago
1999
IEEE
A structured approach to parallel programming allows to construct applications by composing skeletons, i.e., recurring patterns of task- and data-parallelism. First academic and co...