245 search results - page 40 / 49 » Formal Methods in Industrial Software Standards Enforcement |
SIAMCO
2011
12 years 10 months ago
2011
Abstract. We prove a weak version of the dynamic programming principle for standard stochastic control problems and mixed control-stopping problems, which avoids the technical di�...
SIAMCOMP
2011
12 years 10 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
ISOLA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. The Implicit Path Enumeration Technique (IPET) has become widely accepted as a powerful technique to compute upper bounds on the Worst-Case Execution Time (WCET) of time-...
CIKM
2010
Springer
13 years 4 months ago
2010
Springer
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
ICWS
2009
IEEE
14 years 4 months ago
2009
IEEE
Professional mashups that include complex choreographies, data mediation, and result publishing within Web pages are still affected by implementation and design practices that rel...