1174 search results - page 7 / 235 » Optimizing generics is easy! |
KBSE
2010
IEEE
14 years 7 months ago
2010
IEEE
This paper proposes GenericDiff, a general framework for model comparison. The main idea is to separate the specification of domain-specific model properties and syntax from the g...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We propose a generic design for Chinese remainder algorithms. A Chinese remainder computation consists in reconstructing an integer value from its residues modulo non coprime inte...
CCO
2001
Springer
15 years 2 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
164
click to vote
POPL
2001
ACM
15 years 9 months ago
2001
ACM
We propose a general, powerful framework of type systems for the -calculus, and show that we can obtain as its instances a variety of type systems guaranteeing non-trivial propert...
85
Voted
B
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Writing a formal specification for real-life, industrial problems is a difficult and error prone task, even for experts in formal methods. In the process of specifying a...