Sciweavers

1237 search results - page 58 / 248
» Abstract shade trees
Sort
View
COCOA
2010
Springer
15 years 2 months ago
Feasibility-Based Bounds Tightening via Fixed Points
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 ...
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...
ECOOP
2004
Springer
15 years 10 months ago
Rewritable Reference Attributed Grammars
This paper presents an object-oriented technique for rewriting abstract syntax trees in order to simplify compilation. The technique, Rewritable Reference Attributed Grammars (ReRA...
Torbjörn Ekman, Görel Hedin
FSTTCS
2001
Springer
15 years 9 months ago
Rewrite Closure for Ground and Cancellative AC Theories
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
Ashish Tiwari
CALCO
2007
Springer
95views Mathematics» more  CALCO 2007»
15 years 10 months ago
Higher Dimensional Trees, Algebraically
In formal language theory, James Rogers published a series of innovative papers generalising strings and trees to higher dimensions.Motivated by applications in linguistics, his go...
Neil Ghani, Alexander Kurz
ECML
2007
Springer
15 years 10 months ago
Clustering Trees with Instance Level Constraints
Abstract. Constrained clustering investigates how to incorporate domain knowledge in the clustering process. The domain knowledge takes the form of constraints that must hold on th...
Jan Struyf, Saso Dzeroski