74 search results - page 5 / 15 » Exploiting equalities in polynomial programming |
ICFP
2004
ACM
14 years 7 months ago
2004
ACM
We study a type system equipped with universal types and equirecursive types, which we refer to as F?. We show that type equality may be decided in time O(n log n), an improvement...
APLAS
2008
ACM
13 years 9 months ago
2008
ACM
Abstract. We propose c2-calculus, which is a second-order polymorphic call-by-value calculus with extensional universal types. Unlike product types or function types in call-by-val...
STOC
2001
ACM
14 years 7 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
COCOA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
HYBRID
2010
Springer
14 years 2 months ago
2010
Springer
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...