Sciweavers

2944 search results - page 319 / 589
» On Well Quasi-orders on Languages
Sort
View
ITS
2000
Springer
137views Multimedia» more  ITS 2000»
15 years 10 months ago
Design Principles for a System to Teach Problem Solving by Modelling
This paper presents an approach to the design of a learning environment in a mathematical domain (elementary combinatorics) where problem solving is based more on modelling than o...
Gérard Tisseau, Hélène Giroir...
175
Voted
FPLE
1995
15 years 10 months ago
Basic Proof Skills of Computer Science Students
Computer science students need mathematical proof skills. At our University, these skills are being taught as part of various mathematics and computer science courses. To test the ...
Pieter H. Hartel, Bert van Es, Dick Tromp
PLDI
1995
ACM
15 years 10 months ago
APT: A Data Structure for Optimal Control Dependence Computation
The control dependence relation is used extensively in restructuring compilers. This relation is usually represented using the control dependence graph; unfortunately, the size of...
Keshav Pingali, Gianfranco Bilardi
ASPLOS
1991
ACM
15 years 10 months ago
Code Generation for Streaming: An Access/Execute Mechanism
Access/execute architectures have several advantages over more traditional architectures. Because address generation and memory access are decoupled from operand use, memory laten...
Manuel E. Benitez, Jack W. Davidson
ICDT
2010
ACM
194views Database» more  ICDT 2010»
15 years 8 months ago
Bag Equivalence of XPath Queries
When a query is evaluated under bag semantics, each answer is returned as many times as it has derivations. Bag semantics has long been recognized as important, especially when ag...
Sara Cohen, Yaacov Y. Weiss