9520 search results - page 1662 / 1904 » or 2011 |
247
Voted
ALGORITHMICA
2011
15 years 1 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
226
click to vote
AML
2011
15 years 1 months ago
2011
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
218
click to vote
AOSD
2011
ACM
15 years 1 months ago
2011
ACM
The domain of operating systems has often been mentioned as an “ideal candidate” for the application of AOP; fundamental policies we find in these systems, such as synchroniz...
188
click to vote
AOSD
2011
ACM
15 years 1 months ago
2011
ACM
Block joinpoints allow programmers to explicitly mark regions of base code as “to be advised”, thus avoiding the need to extract the block into a method just for the sake of c...
226
Voted
AOSD
2011
ACM
15 years 1 months ago
2011
ACM
Software systems are increasingly being built as compositions of reusable artifacts (components, frameworks, toolkits, plug-ins, APIs, etc) that have non-trivial usage constraints...