Sciweavers

4463 search results - page 197 / 893
» computer 2000
Sort
View
138
Voted
COMGEO
2000
ACM
15 years 3 months ago
Computing simple paths among obstacles
Given a set X of points in the plane, two distinguished points s,t X, and a set of obstacles represented by line segments, we wish to compute a simple polygonal path from s to t...
Qi Cheng, Marek Chrobak, Gopalakrishnan Sundaram
152
Voted
ACSE
2000
ACM
15 years 8 months ago
Time studies as a tool for (computer science) education research
Computer Science Education Research is often done in a very local setting and findings are difficult to transfer to other institutions. There are however several factors that spea...
Anna Sandström, Mats Daniels
FROCOS
2000
Springer
15 years 7 months ago
Non-Trivial Symbolic Computations in Proof Planning
Abstract. We discuss a pragmatic approach to integrate computer algebra into proof planning. It is based on the idea to separate computation and veri cation and can thereby exploit...
Volker Sorge
153
Voted
CORR
2000
Springer
95views Education» more  CORR 2000»
15 years 3 months ago
One Complexity Theorist's View of Quantum Computing
The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or t...
Lance Fortnow
137
Voted
AMAI
2000
Springer
15 years 3 months ago
A survey of temporal extensions of description logics
principled ones
Alessandro Artale, Enrico Franconi