Sciweavers

8512 search results - page 1375 / 1703
» Computing Theory With Relevance
Sort
View
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
ACMDIS
2010
ACM
15 years 7 months ago
A tale of two publics: democratizing design at the margins
The design and use of Information and Communication Technology (ICT) has now evolved beyond its workplace origins to the wider public, expanding to people who live at the margins ...
Christopher A. Le Dantec, Jim Christensen, Mark Ba...
AI
2006
Springer
15 years 6 months ago
Generating and evaluating evaluative arguments
Evaluative arguments are pervasive in natural human communication. In countless situations people attempt to advise or persuade their interlocutors that something is desirable (vs...
Giuseppe Carenini, Johanna D. Moore
COMPUTER
2006
84views more  COMPUTER 2006»
15 years 6 months ago
Testable, Reusable Units of Cognition
The educational content of a technical topic consists, ultimately, of elementary chunks of knowledge. Identifying and classifying such units -- Testable, Reusable Units of Cogniti...
Bertrand Meyer
CPHYSICS
2006
85views more  CPHYSICS 2006»
15 years 6 months ago
Simulation of n-qubit quantum systems. II. Separability and entanglement
Studies on the entanglement of n-qubit quantum systems have attracted a lot of interest during recent years. Despite the central role of entanglement in quantum information theory...
T. Radtke, S. Fritzsche
« Prev « First page 1375 / 1703 Last » Next »