632 search results - page 68 / 127 » Proving Invariants of Functional Programs |
INFORMS
2008
15 years 17 days ago
2008
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
85
Voted
CP
2006
Springer
15 years 4 months ago
2006
Springer
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
105
Voted
CORR
2008
Springer
15 years 19 days ago
2008
Springer
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
94
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in the framework of sy...
104
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We develop an abstract model of information acquisition from redundant data. We assume a random sampling process from data which contain information with bias and are interested in...