1550 search results - page 204 / 310 » Benchmarking for Graph Transformation |
81
Voted
ISCIS
2009
Springer
15 years 7 months ago
2009
Springer
—In this paper, we combine graph coloring heuristics, namely largest degree and saturation degree with the concept of a heuristic modifier under the framework of squeaky wheel op...
99
Voted
ODBIS
2007
Springer
15 years 6 months ago
2007
Springer
In order to cope with the expected size of the Semantic Web (SW) in the coming years, we need to benchmark existing SW tools (e.g., query language interpreters) in a credible manne...
106
Voted
SAC
2004
ACM
15 years 6 months ago
2004
ACM
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
107
Voted
FCCM
2002
IEEE
15 years 5 months ago
2002
IEEE
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
112
Voted
SIGMOD
2010
ACM
15 years 5 months ago
2010
ACM
In this paper, we propose an online aggregation system called COSMOS (Continuous Sampling for Multiple queries in an Online aggregation System), to process multiple aggregate quer...