Sciweavers

3946 search results - page 162 / 790
» The computational complexity of choice sets
Sort
View
RAM
2008
IEEE
95views Robotics» more  RAM 2008»
16 years 29 days ago
A New Distance Algorithm and Its Application to General Force-Closure Test
This paper presents an algorithm for computing the distance between a point and a convex cone in n-dimensional space. The convex cone is specified by the set of all nonnegative com...
Yu Zheng, Chee-Meng Chew
PPSN
1998
Springer
15 years 10 months ago
On Risky Methods for Local Selection under Noise
The choice of the selection method used in an evolutionary algorithm may have considerable impacts on the behavior of the entire algorithm. Therefore, earlier work was devoted to t...
Günter Rudolph
ACSC
2004
IEEE
15 years 10 months ago
Learning Models for English Speech Recognition
This paper reports on an experiment to determine the optimal parameters for a speech recogniser that is part of a computer aided instruction system for assisting learners of Engli...
Huayang Xie, Peter Andreae, Mengjie Zhang, Paul Wa...
STOC
2006
ACM
120views Algorithms» more  STOC 2006»
16 years 6 months ago
Black-box constructions for secure computation
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Ere...
ICRA
2006
IEEE
118views Robotics» more  ICRA 2006»
16 years 18 days ago
Symbolic Control for Underactuated Differentially Flat Systems
— In this paper we address the problem of generating input plans to steer complex dynamical systems in an obstaclefree environment. Plans considered admit a finite description l...
Adriano Fagiolini, Luca Greco, Antonio Bicchi, Ben...