8298 search results - page 352 / 1660 » On the Complexity of Numerical Analysis |
209
click to vote
WSCG
2003
15 years 9 months ago
2003
We present a refinement and a coarsening (also simplification or decimation) algorithm for the adaptive representation of bivariate functions. The algorithms have proved to be eff...
180
click to vote
ICFEM
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Automated verification of memory safety and functional correctness for heap-manipulating programs has been a challenging task, especially when dealing with complex data ...
202
click to vote
JPDC
2010
15 years 6 months ago
2010
Transactional Memory (TM) is a promising abstraction as it hides all synchronization complexities from the programmers of concurrent applications. More particularly the TM paradig...
221
click to vote
CP
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Interval-based methods can approximate all the real solutions of a system of equations and inequalities. The Box interval constraint propagation algorithm enforces Box co...
183
Voted
IPPS
2003
IEEE
16 years 25 days ago
2003
IEEE
We propose a method for the timing analysis of concurrent real-time programs with hard deadlines. We divide the analysis into a machine-independent and a machinedependent task. Th...