Sciweavers

1943 search results - page 361 / 389
» Ordering Default Theories
Sort
View
SPAA
1996
ACM
14 years 3 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
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...
Michael Mitzenmacher
HICSS
1994
IEEE
141views Biometrics» more  HICSS 1994»
14 years 3 months ago
Empirical CATeam Research in Meetings
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...
Helmut Krcmar, Henrik Lewe, Gerhard Schwabe
IFIP
1994
Springer
14 years 2 months ago
Exploring user interfaces to improve learning outcomes
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...
PODS
1994
ACM
138views Database» more  PODS 1994»
14 years 2 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
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 {...
Sushant Patnaik, Neil Immerman
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
14 years 2 months ago
Fast algorithms for finding randomized strategies in game trees
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...