8132 search results - page 229 / 1627 » Dependability, Abstraction, and Programming |
195
click to vote
SIAMJO
2000
15 years 6 months ago
2000
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
138
click to vote
CTCS
1989
Springer
15 years 10 months ago
1989
Springer
The type-theoretic explanation of modules proposed to date (for programming languages like ML) is unsatisfactory, because it does not capture that evaluation of type-expressions i...
170
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
Answer set programs with time predicates are useful to model systems whose properties depend on time, like for example gene regulatory networks. A state of such a system at time po...
185
click to vote
PEPM
2011
ACM
14 years 9 months ago
2011
ACM
Writing deterministic programs is often difficult for problems whose optimal solutions depend on unpredictable properties of the programs’ inputs. Difficulty is also encounter...
188
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Encapsulation of states in object-oriented programs hinders the search for test data using evolutionary testing. As client code is oblivious to the internal state of a server obje...