Search Sciweavers | Sciweavers

It is shown that for any 2-computably enumerable Turing degree l, any computably enumerable degree a, and any Turing degree s, if l = 0 , l < a, s 0 , and s is c.e. in a, then...

Carl G. Jockusch Jr., Angsheng Li

claim paper

Read More »

111

click to vote

HF
2007

48views more HF 2007»

Developing Operator Capacity Estimates for Supervisory Control of Autonomous Vehicles

15 years 6 months ago

Download www.sys.virginia.edu

M. L. Cummings, Stephanie A. Guerlain

claim paper

Read More »

click to vote

PCS
2008

57views more PCS 2008»

An extension of the light meshes method for three-dimensional scenes with semitransparent surfaces

15 years 6 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers