Sciweavers

8695 search results - page 179 / 1739
» Making the Complex Simple
Sort
View
CORR
2010
Springer
76views Education» more  CORR 2010»
15 years 6 months ago
Nonadaptive quantum query complexity
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
Ashley Montanaro
IJFCS
2006
70views more  IJFCS 2006»
15 years 6 months ago
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...
CORR
1998
Springer
117views Education» more  CORR 1998»
15 years 6 months ago
A Human - machine interface for teleoperation of arm manipulators in a complex environment
This paper discusses the feasibility of using conguration space C-space as a means of visualization and control in operator-guided real-time motion of a robot arm manipulator. T...
Igor Ivanisevic, Vladimir J. Lumelsky
AAAI
2012
13 years 9 months ago
Crossing Boundaries: Multi-Level Introspection in a Complex Robotic Architecture for Automatic Performance Improvements
Introspection mechanisms are employed in agent architectures to improve agent performance. However, there is currently no approach to introspection that makes automatic adjustment...
Evan A. Krause, Paul W. Schermerhorn, Matthias Sch...
SAC
2009
ACM
16 years 1 months ago
Static type inference for Ruby
Many general-purpose, object-oriented scripting languages are dynamically typed, to keep the language flexible and not reject any programs unnecessarily. However, dynamic typing ...
Michael Furr, Jong-hoon (David) An, Jeffrey S. Fos...