3889 search results - page 702 / 778 » The Use of Program Dependence Graphs in Software Engineering |
126
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
126
Voted
COMSWARE
2007
IEEE
15 years 9 months ago
2007
IEEE
—This paper deals with the topology formation schemes in the IEEE 802.11 based wireless mesh network. The recent standardization effort for specifying a wireless distribution sys...
138
Voted
FSTTCS
2007
Springer
15 years 9 months ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
129
Voted
ACMMSP
2004
ACM
15 years 9 months ago
2004
ACM
Irregular applications frequently exhibit poor performance on contemporary computer architectures, in large part because of their inefficient use of the memory hierarchy. Runtime ...
119
Voted
CIKM
1999
Springer
15 years 7 months ago
1999
Springer
The web hasgreatly improved accessto scientific literature. However, scientific articles on the web are largely disorganized, with research articles being spreadacrossarchive site...