2477 search results - page 174 / 496 » Parallelizing Functional Programs by Generalization |
152
click to vote
TCS
2008
15 years 6 months ago
2008
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
188
click to vote
SIAMJO
2000
15 years 5 months ago
2000
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
205
click to vote
FCCM
2008
IEEE
16 years 18 days ago
2008
IEEE
The map-reduce model requires users to express their problem in terms of a map function that processes single records in a stream, and a reduce function that merges all mapped out...
161
click to vote
ACSC
2006
IEEE
16 years 6 days ago
2006
IEEE
Manipulating semistructured data, such as XML, does not t well within conventional programming languages. A typical manipulation requires nding all occurrences of a structure matc...
138
Voted
CIE
2009
Springer
16 years 22 days ago
2009
Springer
Abstract. Intuitively, a recursion theorem asserts the existence of selfreferential programs. Two well-known recursion theorems are Kleene’s Recursion Theorem (krt) and Rogers’...