Sciweavers

6274 search results - page 1193 / 1255
» From query complexity to computational complexity
Sort
View
ICRA
2002
IEEE
187views Robotics» more  ICRA 2002»
15 years 9 months ago
Trajectory Planning using Reachable-State Density Functions
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
Richard Mason, Joel W. Burdick
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
15 years 8 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
SIGMETRICS
2010
ACM
233views Hardware» more  SIGMETRICS 2010»
15 years 8 months ago
Incentivizing peer-assisted services: a fluid shapley value approach
A new generation of content delivery networks for live streaming, video on demand, and software updates takes advantage of a peer-to-peer architecture to reduce their operating co...
Vishal Misra, Stratis Ioannidis, Augustin Chaintre...
SIGGRAPH
2010
ACM
15 years 8 months ago
Toward evaluating material design interface paradigms for novice users
Material design is the process by which artists specify the reflectance properties of a surface, such as its diffuse color and specular roughness. We present a user study to eval...
William B. Kerr, Fabio Pellacini
ICCS
2001
Springer
15 years 8 months ago
Inclusion-Based Approximate Reasoning
Nowadays, people start to accept fuzzy rule–based systems as flexible and convenient tools to solve a myriad of ill–defined but otherwise (for humans) straightforward tasks s...
Chris Cornelis, Etienne E. Kerre
« Prev « First page 1193 / 1255 Last » Next »