4491 search results - page 377 / 899 » Algorithm Engineering |
126
click to vote
FSTTCS
2006
Springer
15 years 7 months ago
2006
Springer
The boundary labeling problem was recently introduced in [5] as a response to the problem of labeling dense point sets with large labels. In boundary labeling, we are given a recta...
132
click to vote
PEPM
2000
ACM
15 years 7 months ago
2000
ACM
Many program optimisations and analyses, such as arraybound checking, termination analysis, etc, dependon knowing the size of a function's input and output. However, size inf...
142
click to vote
DAC
1995
ACM
15 years 7 months ago
1995
ACM
We study the minimum-costbounded-skewrouting tree (BST) problem under the linear delay model. This problem captures several engineering tradeoffs in the design of routing topologi...
146
click to vote
ESEM
2007
ACM
15 years 5 months ago
2007
ACM
Can we predict locations of future refactoring based on the development history? In an empirical study of open source projects we found that attributes of software evolution data ...
131
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
Modularity and symmetry are two properties observed in almost every engineering and biological structure. The origin of these properties in nature is still unknown. Yet, as engine...