3889 search results - page 28 / 778 » A Framework for Optimizing Paper Matching |
IEEEPACT
2005
IEEE
15 years 3 months ago
2005
IEEE
Dynamic optimization has the potential to adapt the program’s behavior at run-time to deliver performance improvements over static optimization. Dynamic optimization systems usu...
EVOW
2005
Springer
15 years 3 months ago
2005
Springer
This paper describes a new Ant Colony Optimization (ACO) algorithm for solving Graph Matching Problems, the goal of which is to find the best matching between vertices of multi-la...
CGI
2004
IEEE
15 years 1 months ago
2004
IEEE
Three dimensional shape matching plays an important role in many of today's applications. Nevertheless, shape matching is a difficult problem since there is no unique measure...
100
click to vote
APCSAC
2004
IEEE
15 years 1 months ago
2004
IEEE
Dynamic optimization presents opportunities for finding run-time bottlenecks and deploying optimizations in statically compiled programs. In this paper, we discuss our current impl...
90
Voted
ML
2008
ACM
14 years 9 months ago
2008
ACM
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decis...