1423 search results - page 74 / 285 » Languages of Nested Trees |
118
click to vote
CGO
2011
IEEE
14 years 3 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
102
click to vote
ERSHOV
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...
LOPSTR
2007
Springer
15 years 6 months ago
2007
Springer
We propose an extension of Constraint Handling Rules (CHR) with aggregates such as sum, count, findall, and min. This new feature significantly improves the conciseness and expres...
FMOODS
2007
15 years 1 months ago
2007
Abstract. Algorithmic skeletons are a well-known approach for implementing parallel and distributed applications. Declarative versions typically use higher-order functions in funct...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...