868 search results - page 52 / 174 » Debugging for Model Expansion |
ICTAI
1996
IEEE
14 years 2 months ago
1996
IEEE
This paper presents an approach to building plans using partially observable Markov decision processes. The approach begins with a base solution that assumes full observability. T...
ICCAD
2004
IEEE
14 years 6 months ago
2004
IEEE
In this paper we describe a stochastic integral equation method for computing the mean value and the variance of capacitance of interconnects with random surface roughness. An ens...
FAW
2008
Springer
13 years 11 months ago
2008
Springer
We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, whic...
JSYML
2010
13 years 4 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
FOSSACS
2006
Springer
14 years 1 months ago
2006
Springer
Reversible computation has a growing number of promising application areas such as the modelling of biochemical systems, program debugging and testing, and even programming languag...