Sciweavers

2536 search results - page 238 / 508
» Constructing Optimal Highways
Sort
View
HEURISTICS
2008
92views more  HEURISTICS 2008»
15 years 4 months ago
Learning heuristics for basic block instruction scheduling
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to ...
Abid M. Malik, Tyrel Russell, Michael Chase, Peter...
DM
2006
122views more  DM 2006»
15 years 4 months ago
Labeling trees with a condition at distance two
An L(h, k)-labeling of a graph G is an integer labeling of vertices of G, such that adjacent vertices have labels which differ by at least h, and vertices at distance two have lab...
Tiziana Calamoneri, Andrzej Pelc, Rossella Petresc...
CAD
2007
Springer
15 years 4 months ago
Generating strictly non-self-overlapping structured quadrilateral grids
In this paper, we present a BPM (Bézier Patch Mapping) algorithm which generates a strictly non-self-overlapping structured quadrilateral grid in a given four-sided planar region...
Hongwei Lin, Kai Tang, Ajay Joneja, Hujun Bao
IANDC
2006
101views more  IANDC 2006»
15 years 4 months ago
Mind change efficient learning
This paper studies efficient learning with respect to mind changes. Our starting point is the idea that a learner that is efficient with respect to mind changes minimizes mind cha...
Wei Luo, Oliver Schulte
CORR
2007
Springer
77views Education» more  CORR 2007»
15 years 4 months ago
On the interaction between sharing and linearity
nalysis of logic programs, abstract domains for detecting sharing and linearity ion are widely used. Devising abstract unification algorithms for such domains has proved to be ra...
Gianluca Amato, Francesca Scozzari