1940 search results - page 293 / 388 » Graph Transformation with Variables |
145
click to vote
AGTIVE
2003
Springer
15 years 10 months ago
2003
Springer
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...
188
click to vote
ICPP
1996
IEEE
15 years 9 months ago
1996
IEEE
Data locality and synchronization overhead are two important factors that affect the performance of applications on multiprocessors. Loop fusion is an effective way for reducing s...
132
click to vote
FOAL
2009
ACM
15 years 8 months ago
2009
ACM
In this paper we specify an operational run-time semantics of Assignment Featherweight Java -- a minimal subset of Java with assignments -- with around advice, using graph transfo...
123
click to vote
FASE
2010
Springer
15 years 8 months ago
2010
Springer
Services provide access to software components that can be discovered dynamically via the Internet. The increasing number of services a requesters may be able to use demand support...
140
click to vote
COCOA
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...