Sciweavers

14084 search results - page 2648 / 2817
» A Theory for Game Theories
Sort
View
IFIP
1994
Springer
15 years 10 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...
IUI
1993
ACM
15 years 10 months ago
Wizard of Oz studies: why and how
We discuss current approaches to the development of natural language dialogue systems, and claim that they do not sufficiently consider the unique qualities of man-machine intera...
Nils Dahlbäck, Arne Jönsson, Lars Ahrenb...
FSTTCS
1992
Springer
15 years 10 months ago
Structural Average Case Complexity
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
Rainer Schuler, Tomoyuki Yamakami
PODS
1994
ACM
138views Database» more  PODS 1994»
15 years 10 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
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 10 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
« Prev « First page 2648 / 2817 Last » Next »