6274 search results - page 221 / 1255 » Proofs, Programs, Processes |
166
click to vote
SIAMJO
2010
15 years 1 months ago
2010
Necessary first-order sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. These conditions are sati...
152
click to vote
JLP
2011
14 years 9 months ago
2011
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchange law: when applied in a trace model of program semantics, one of them stands...
201
click to vote
APLAS
2011
ACM
14 years 6 months ago
2011
ACM
Modern multi-core microprocessors implement weak memory consistency models; programming for these architectures is a challenge. This paper solves a problem open for ten years, and ...
165
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. This paper presents the syntax and semantics of a simplified version of a logic-based agent-oriented programming language to implement agents with emotions. Four types of...
169
click to vote
LOPSTR
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. The goal of partial evaluation is the specialization of programs w.r.t. part of their input data. Although this technique is already well-known in the context of function...