2300 search results - page 295 / 460 » Maximally Concurrent Programs |
137
Voted
ICALP
1997
Springer
15 years 10 months ago
1997
Springer
We propose a general approach for defining behavioural preorders over process terms as the maximal pre–congruences induced by basic observables. We will consider three of these...
141
click to vote
POPL
1994
ACM
15 years 10 months ago
1994
ACM
This paper discusses call forwarding, a simple interprocedural optimization technique for dynamically typed languages. The basic idea behind the optimization is straightforward: n...
186
click to vote
WCET
2003
15 years 7 months ago
2003
Worst-Case Execution Time (WCET) analysis means to compute a safe upper bound to the execution time of a piece of code. Parametric WCET analysis yields symbolic upper bounds: expr...
239
click to vote
IPL
2006
15 years 6 months ago
2006
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
205
click to vote
JSAC
2006
15 years 6 months ago
2006
Routing and wavelength assignment (RWA) aims to assign the limited number of wavelengths in a wavelength-division multiplexed (WDM) optical network so as to achieve greater capacit...