Sciweavers

6358 search results - page 324 / 1272
» Computing spectral sequences
Sort
View
AAAI
2006
15 years 8 months ago
Introductory Computer Science with Robots
Starting in the fall of 2005 our department began a large-scale effort to incorporate hands-on robotics in many of our courses, including our introductory computer science sequenc...
Debra T. Burhans, R. Mark Meyer, Patricia VanVerth...
IJCAI
2001
15 years 8 months ago
Computational Complexity of Planning with Temporal Goals
In the last decade, there has been several studies on the computational complexity of planning. These studies normally assume that the goal of planning is to make a certain fluent...
Chitta Baral, Vladik Kreinovich, Raul Trejo
CAGD
2007
75views more  CAGD 2007»
15 years 6 months ago
Computing roots of polynomials by quadratic clipping
We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip boun...
Michael Barton, Bert Jüttler
MST
2008
150views more  MST 2008»
15 years 6 months ago
Coinduction for Exact Real Number Computation
This paper studies coinductive representations of real numbers by signed digit streams and fast Cauchy sequences. It is shown how the associated coinductive principle can be used ...
Ulrich Berger, Tie Hou
CORR
2004
Springer
123views Education» more  CORR 2004»
15 years 6 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui