151 search results - page 8 / 31 » Optimal Acceptors and Optimal Proof Systems |
PLDI
2003
ACM
14 years 25 days ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
SAT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
PRICAI
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We consider the problem of computing optimal plans for propositional planning problems with action costs. In the spirit of leveraging advances in general-purpose automate...
SIAMJO
2008
13 years 7 months ago
2008
A class of trust-region methods is presented for solving unconstrained nonlinear and possibly nonconvex discretized optimization problems, like those arising in systems governed by...
ISCI
2006
13 years 7 months ago
2006
Particle swarm optimization (PSO) has shown to be an efficient, robust and simple optimization algorithm. Most of the PSO studies are empirical, with only a few theoretical analys...