We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Meeting research and especially research on Computer Supported Meetings of natural teams is not available in abundance. What is reported of meetings often uses a rather limited th...
The concept of information landscapes has been a constant theme in the development of interactive multimedia packages. For the interface and access to this information to be effec...
John G. Hedberg, Barry Harper, Christine Brown, Ro...
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...