1461 search results - page 229 / 293 » Analysis of Constraint Logic Programs |
SIAMJO
2002
13 years 7 months ago
2002
Most local convergence analyses of the sequential quadratic programming (SQP) algorithm for nonlinear programming make strong assumptions about the solution, namely, that the activ...
ISPASS
2006
IEEE
14 years 1 months ago
2006
IEEE
Fast, accurate, and effective performance analysis is essential for the design of modern processor architectures and improving application performance. Recent trends toward highly...
TACAS
2009
Springer
14 years 2 months ago
2009
Springer
TAPAS is a suite of libraries dedicated to FO (R, Z, +, ≤). The suite provides (1) the application programming interface GENEPI for this logic with encapsulations of many classic...
HICSS
2005
IEEE
14 years 1 months ago
2005
IEEE
Robert Thomas has shown, using simulations of experimental results, that the power flow on any line in an electric network is linearly proportional to the total system load when t...
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...