The problem of estimating the capacity of an Internet path is one of fundamental importance. Due to the multitude of potential applications, a large number of solutions have been ...
Rohit Kapoor, Ling-Jyh Chen, Alok Nandan, Mario Ge...
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Recently, several languages for web service composition have emerged (e.g., BPEL4WS and WSCI). The goal of these languages is to glue web services together in a process-oriented w...
Wil M. P. van der Aalst, Marlon Dumas, Arthur H. M...
Cooperation is the fundamental underpinning of multi-agent systems, allowing agents to interact to achieve their goals. Where agents are self-interested, or potentially unreliable...
We present a simple technique for creating fluid silhouettes described with vector graphics, which we call ”Vector Fluid.” In our system, a solid region in the fluid is repr...