Sciweavers

121 search results - page 9 / 25
» ideas 1997
Sort
View
SIGCSE
1997
ACM
112views Education» more  SIGCSE 1997»
13 years 11 months ago
Introducing fixed-point iteration early in a compiler course
When teaching a course in compiler design, it is conventional to introduce the iterative calculation of least fixed points quite late in the course, in the guise of iterative dat...
Max Hailperin
VRST
1997
ACM
13 years 11 months ago
An efficient collision detection algorithm using range data for walk-through systems
We present a simple, but efficient view collision detection method for the walk-through system. The basic idea is to check if the current view position intersects with the range d...
SonOu Lee, JunHyeok Heo, KwangYun Wohn
AADEBUG
1997
Springer
13 years 11 months ago
Observation and Control for Debugging Distributed Computations
I present a general framework for observing and controlling a distributed computation and its applications to distributed debugging. Algorithms for observation are useful in distr...
Vijay K. Garg
AAECC
1997
Springer
115views Algorithms» more  AAECC 1997»
13 years 11 months ago
Efficient Multivariate Factorization over Finite Fields
We describe the Maple [23] implementation of multivariate factorization over general finite fields. Our first implementation is available in Maple V Release 3. We give selected det...
Laurent Bernardin, Michael B. Monagan
ECP
1997
Springer
130views Robotics» more  ECP 1997»
13 years 11 months ago
Encoding Planning Problems in Nonmonotonic Logic Programs
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...
Yannis Dimopoulos, Bernhard Nebel, Jana Koehler