32 search results - page 4 / 7 » ci 2010 |
FSTTCS
2010
Springer
13 years 6 months ago
2010
Springer
A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of d...
SOFSEM
2010
Springer
14 years 5 months ago
2010
Springer
We present a new technique to prove termination of Term Rewriting Systems, with full automation. A crucial task in this context is to find suitable well-founded orderings. A popul...
MST
2010
13 years 7 months ago
2010
Partial words are finite sequences over a finite alphabet A that may contain a number of “do not know” symbols denoted by ’s. Setting A = A ∪ { }, A∗ denotes the set o...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
: We extend Goldie's (1991) Implicit Renewal Theorem to enable the analysis of recursions on weighted branching trees. We illustrate the developed method by deriving the power...
PROCEDIA
2010
13 years 7 months ago
2010
We discuss the scaling behavior of a state-of-the-art Configuration Interaction code for nuclear physics on modern multicore computer architectures. In the CI approach, the quant...