Sciweavers

134 search results - page 2 / 27
» Finiteness Conditions for Strictness Analysis
Sort
View
FPCA
1995
13 years 8 months ago
How Much Non-Strictness do Lenient Programs Require?
Lenient languages, such as Id90, have been touted as among the best functional languages for massively parallel machines AHN88]. Lenient evaluation combines non-strict semantics w...
Klaus E. Schauser, Seth Copen Goldstein
DAC
2002
ACM
14 years 6 months ago
Model order reduction for strictly passive and causal distributed systems
This paper presents a class of algorithms suitable for model reduction of distributed systems. Distributed systems are not suitable for treatment by standard model-reduction algor...
Luca Daniel, Joel R. Phillips
SIAMNUM
2010
105views more  SIAMNUM 2010»
13 years 1 days ago
Convergence Analysis for Incompressible Generalized Newtonian Fluid Flows with Nonstandard Anisotropic Growth Conditions
We study equations to describe incompressible generalized Newtonian fluids, where the extra stress tensor satisfies a nonstandard anisotropic asymptotic growth condition. An implic...
Erich Carelli, Jonas Haehnle, Andreas Prohl
MOC
1998
106views more  MOC 1998»
13 years 5 months ago
Bounds for eigenvalues and condition numbers in the p-version of the finite element method
In this paper, we present a theory for bounding the minimum eigenvalues, maximum eigenvalues, and condition numbers of stiffness matrices arising from the p-version of finite ele...
Ning Hu, Xian-Zhong Guo, I. Norman Katz
ICML
2010
IEEE
13 years 6 months ago
Convergence of Least Squares Temporal Difference Methods Under General Conditions
We consider approximate policy evaluation for finite state and action Markov decision processes (MDP) in the off-policy learning context and with the simulation-based least square...
Huizhen Yu