1550 search results - page 93 / 310 » Benchmarking for Graph Transformation |
143
click to vote
CASES
2010
ACM
15 years 1 days ago
2010
ACM
Approximate arithmetic is a promising, new approach to lowenergy designs while tackling reliability issues. We present a method to optimally distribute a given energy budget among...
78
Voted
BIRTHDAY
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...
107
Voted
CEC
2007
IEEE
15 years 9 months ago
2007
IEEE
— Addressing dynamic optimization problems has attracted a growing interest from the evolutionary algorithm community in recent years due to its importance in the applications of...
115
click to vote
OOPSLA
1999
Springer
15 years 7 months ago
1999
Springer
Java programs perform many synchronization operations on data structures. Some of these synchronizations are unnecessary; in particular, if an object is reachable only by a single ...
145
click to vote
LCTRTS
2009
Springer
15 years 10 months ago
2009
Springer
The StreamIt programming model has been proposed to exploit parallelism in streaming applications on general purpose multicore architectures. The StreamIt graphs describe task, da...