Sciweavers

222 search results - page 37 / 45
» Representing dialogic argumentation
Sort
View
SP
1998
IEEE
106views Security Privacy» more  SP 1998»
14 years 22 days ago
Understanding Java Stack Inspection
Current implementations of Java make security decisions by searching the runtime call stack. These systems have attractive security properties, but they have been criticized as be...
Dan S. Wallach, Edward W. Felten
ICFP
1998
ACM
14 years 22 days ago
Intensional Polymorphism in Type-Erasure Semantics
Intensional polymorphism, the ability to dispatch to different routines based on types at run time, enables a variety of advanced implementation techniques for polymorphic languag...
Karl Crary, Stephanie Weirich, J. Gregory Morriset...
AIED
2007
Springer
14 years 15 days ago
'Tis Better to Construct than to Receive? The Effects of Diagram Tools on Causal Reasoning
Previous research on the use of diagrams for argumentation instruction has highlighted, but not conclusively demonstrated, their potential benefits. We examine the relative benefit...
Matthew W. Easterday, Vincent Aleven, Richard Sche...
CGO
2004
IEEE
14 years 7 days ago
Optimizing Translation Out of SSA Using Renaming Constraints
Static Single Assignment form is an intermediate representation that uses instructions to merge values at each confluent point of the control flow graph. instructions are not ma...
Fabrice Rastello, François de Ferriè...
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
14 years 22 hour ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson