5377 search results - page 753 / 1076 » Programming Languages For Interactive Computing |
146
click to vote
ICMT
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Graph transformation has a well-established theory and associated tools that can be used to perform model transformations. However, the lack of a construct to match and t...
118
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertic...
137
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
As defined by Aumann in 1959, a strong equilibrium is a Nash equilibrium that is resilient to deviations by coalitions. We give tight bounds on the strong price of anarchy for loa...
129
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
132
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Following the idea developed by I. Simon in his theorem of Ramseyan factorisation forests, we develop a result of ‘deterministic factorisations’. This extra determinism propert...