Sciweavers

3663 search results - page 125 / 733
» Problems in the ontology of computer programs
Sort
View
TOPLAS
2008
78views more  TOPLAS 2008»
14 years 9 months ago
The pitfalls of verifying floating-point computations
Current critical systems often use a lot of floating-point computations, and thus the testing or static analysis of programs containing floatingpoint operators has become a priori...
David Monniaux
CPE
1994
Springer
170views Hardware» more  CPE 1994»
15 years 2 months ago
Automatic Scalability Analysis of Parallel Programs Based on Modeling Techniques
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...
AI
2000
Springer
14 years 9 months ago
Stochastic dynamic programming with factored representations
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
Craig Boutilier, Richard Dearden, Moisés Go...
ACE
2004
218views Education» more  ACE 2004»
14 years 11 months ago
Executable/Translatable UML in Computing Education
The Unified Modelling Language (UML) is a diagrammatic notation widely used in the computing industry and often taught in universities as a way to represent software requirements ...
Shayne Flint, Henry Gardner, Clive Boughton
AUTOMATICA
2010
123views more  AUTOMATICA 2010»
14 years 8 months ago
On the computation of linear model predictive control laws
Finite-time optimal control problems with quadratic performance index for linear systems with linear constraints can be transformed into Quadratic Programs (QPs). Model Predictive ...
Francesco Borrelli, Mato Baotic, Jaroslav Pekar, G...