1550 search results - page 94 / 310 » Benchmarking for Graph Transformation |
160
click to vote
SASP
2008
IEEE
15 years 9 months ago
2008
IEEE
Different approaches have been proposed over the years for automatically transforming High-Level-Languages (HLL) descriptions of applications into custom hardware implementations. ...
136
click to vote
ENTCS
2002
15 years 3 months ago
2002
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...
139
click to vote
IBIS
2006
15 years 3 months ago
2006
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
129
click to vote
CSE
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—Collaborative or “Social” filtering has been successfully deployed over the years as a technique for analysing large amounts of user-preference knowledge to predict...
103
click to vote
AE
2007
Springer
15 years 9 months ago
2007
Springer
The evaluation or fitness function is a key component of any heuristic search algorithm. This paper introduces a new evaluation function for the well-known graph K-coloring proble...