844 search results - page 63 / 169 » Solving the p |
CIT
2006
Springer
15 years 1 months ago
2006
Springer
CA are useful tools in modeling and simulation. However, the more complex a CA is, the longer it takes to run in typical environments. A dedicated CA machine solves this problem by...
CP
2000
Springer
15 years 1 months ago
2000
Springer
The ability to reduce either the number of variables or clauses in instances of the Satisfiability problem (SAT) impacts the expected computational effort of solving a given instan...
DAC
1995
ACM
15 years 1 months ago
1995
ACM
To save memory, layout-to-circuit extractors that use the Finite-Element Method for resistance extraction usually solve the corresponding set of equations with a frontal solution ...
104
click to vote
WSC
2007
15 years 4 days ago
2007
This paper describes two experiments exploring the potential of the Kriging methodology for constrained simulation optimization. Both experiments study an (s, S) inventory system ...
AIPS
2006
14 years 11 months ago
2006
In AI Planning, as well as Verification, a successful method is to compile the application into boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedu...