6315 search results - page 100 / 1263 » Approximating Solution Structure |
138
click to vote
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
— This paper addresses the computational overhead involved in probabilistic reachability computations for a general class of controlled stochastic hybrid systems. An approximate ...
DATE
2008
IEEE
15 years 9 months ago
2008
IEEE
In this paper, we propose a novel approximation algorithm (RelaxSAT) for MIN-ONE SAT. RelaxSAT generates a set of constraints from the objective function to guide the search. The ...
105
click to vote
AIPS
2007
15 years 5 months ago
2007
Relaxations based on (either complete or partial) ignoring delete effects of the actions provide the basis for some seminal classical planning heuristics. However, the palette of ...
111
click to vote
MOC
1998
15 years 2 months ago
1998
Abstract. We present here a mathematical analysis of a nonstandard difference method for the numerical solution of the time dependent GinzburgLandau models of superconductivity. Th...
119
click to vote
ICCAD
2006
IEEE
15 years 12 months ago
2006
IEEE
Recent successful techniques for the efficient simulation of largescale interconnect models rely on the sparsification of the inverse of the inductance matrix L. While there are...