1550 search results - page 104 / 310 » Benchmarking for Graph Transformation |
111
click to vote
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
128
click to vote
ISCAS
1994
IEEE
15 years 7 months ago
1994
IEEE
This paper addresses the problem of minimizing the clock period of a circuit by optimizingthe clock skews. We incorporate uncertainty factors and present a formulation that ensure...
120
Voted
JAIR
2000
15 years 3 months ago
2000
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
218
click to vote
AWIC
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. In this paper, we introduce DegExt, a graph-based languageindependent keyphrase extractor,which extends the keyword extraction method described in [6]. We compare DegExt ...
112
click to vote
MFCS
2007
Springer
15 years 9 months ago
2007
Springer
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...