Sciweavers

6885 search results - page 295 / 1377
» The micro-structure of use of help
Sort
View
DSRT
1999
IEEE
15 years 11 months ago
Resolving Concurrent Interactions
Serialization, the traditional method of resolving concurrent interactions, is often inappropriate; when interactions are dependent on each other, other policies for resolving the...
Anand Natrajan, Paul F. Reynolds Jr.
WIA
1999
Springer
15 years 11 months ago
Animation of the Generation and Computation of Finite Automata for Learning Software
Abstract. In computer science methods to aid learning are very imporcause abstract models are used frequently. For this conventional teaching methods do not suffice. We have develo...
Beatrix Braune, Stephan Diehl, Andreas Kerren, Rei...
COCO
1998
Springer
109views Algorithms» more  COCO 1998»
15 years 11 months ago
Complexity Limitations on Quantum Computation
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the p...
Lance Fortnow, John D. Rogers
IBERAMIA
1998
Springer
15 years 11 months ago
Searching the World Wide Web: Challenges and Partial Solutions
In this article we analyze the problem of searching the WWW, giving some insight and models to understand its complexity. Then we survey the two main current techniques used to se...
Ricardo A. Baeza-Yates
ECOOP
2007
Springer
15 years 11 months ago
A visual interface for type-related refactorings
In this paper, we present our approach to a visual refactoring tool, the Type Access Analyzer (TAA), which uses program analysis to detect code smells and for suggesting and perfo...
Philip Mayer, Andreas Meissner, Friedrich Steimann