Sciweavers

14403 search results - page 112 / 2881
» Dynamical Systems Trees
Sort
View
SAS
2009
Springer
175views Formal Methods» more  SAS 2009»
15 years 10 months ago
Automatic Parallelization and Optimization of Programs by Proof Rewriting
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized an...
Clément Hurlin
VL
1993
IEEE
147views Visual Languages» more  VL 1993»
15 years 2 months ago
Fractal Approaches for Visualizing Huge Hierarchies
This paper describes fractal approaches to the problems which associate with visualizing huge hierarchies. The geometrical characteristic of a fractal, selfsimilarity, allows user...
Hideki Koike, Hirotaka Yoshihara
COMCOM
2006
120views more  COMCOM 2006»
14 years 10 months ago
Explicit routing in multicast overlay networks
Application Level Multicast is a promising approach to overcome the deployment problems of IP level multicast by establishing delivery trees using overlay links among end systems....
Torsten Braun, Vijay Arya, Thierry Turletti
ENTCS
2008
68views more  ENTCS 2008»
14 years 10 months ago
The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems
This paper introduces a new algorithm dedicated to the rigorous reachability analysis of nonlinear dynamical systems. The algorithm is initially presented in the context of discre...
Pieter Collins, Alexandre Goldsztejn
ALDT
2009
Springer
181views Algorithms» more  ALDT 2009»
15 years 4 months ago
Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
Gildas Jeantet, Olivier Spanjaard