Sciweavers

32028 search results - page 6116 / 6406
» Experimenting a
Sort
View
CONNECTION
2008
178views more  CONNECTION 2008»
15 years 6 months ago
Spoken language interaction with model uncertainty: an adaptive human-robot interaction system
Spoken language is one of the most intuitive forms of interaction between humans and agents. Unfortunately, agents that interact with people using natural language often experienc...
Finale Doshi, Nicholas Roy
COR
2008
99views more  COR 2008»
15 years 6 months ago
Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
Over the past few years, several local search algorithms have been proposed for various problems related to multicast routing in the off-line mode. We describe a population-based ...
Mohammed S. Zahrani, Martin J. Loomes, James A. Ma...
161
Voted
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 6 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
CORR
2010
Springer
166views Education» more  CORR 2010»
15 years 6 months ago
A new closed-loop output error method for parameter identification of robot dynamics
Off-line robot dynamic identification methods are mostly based on the use of the inverse dynamic model, which is linear with respect to the dynamic parameters. This model is sample...
Maxime Gautier, Alexandre Janot, Pierre-Olivier Va...
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 6 months ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson
« Prev « First page 6116 / 6406 Last » Next »