Sciweavers

1095 search results - page 117 / 219
» Algebraic Guide Generation
Sort
View
MKM
2005
Springer
14 years 2 months ago
Computational Origami of a Morley's Triangle
Abstract. We present a computational origami construction of Morley’s triangles and automated proof of correctness of the generalized Morley’s theorem in a streamlined process ...
Tetsuo Ida, Hidekazu Takahashi, Mircea Marin
EPIA
1999
Springer
14 years 1 months ago
Combinatorial Optimization in OPL Studio
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the first modeling language to combine high-level algebraic and set notation...
Pascal Van Hentenryck, Laurent Michel, Philippe La...
PLDI
1997
ACM
14 years 1 months ago
Data-centric Multi-level Blocking
We present a simple and novel framework for generating blocked codes for high-performance machines with a memory hierarchy. Unlike traditional compiler techniques like tiling, whi...
Induprakas Kodukula, Nawaaz Ahmed, Keshav Pingali
ICSE
1997
IEEE-ACM
14 years 1 months ago
Assessing Modular Structure of Legacy Code Based on Mathematical Concept Analysis
We apply mathematical concept analysis in order to modularize legacy code. By analysing the relation between procedures and global variables, a so-called concept lattice is constr...
Christian Lindig, Gregor Snelting
ANTS
2010
Springer
260views Algorithms» more  ANTS 2010»
14 years 1 months ago
On the Complexity of the Montes Ideal Factorization Algorithm
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
David Ford, Olga Veres