3244 search results - page 150 / 649 » On convex complexity measures |
108
click to vote
ICRA
2008
IEEE
15 years 8 months ago
2008
IEEE
— In this paper, a novel approach for parallel kinematic machine control relying on a fast exteroceptive measure is implemented and validated on the Orthoglide robot. This approa...
124
Voted
IJON
2008
15 years 10 days ago
2008
The problem of inductive supervised learning is discussed in this paper within the context of multi-objective (MOBJ) optimization. The smoothness-based apparent (effective) comple...
108
Voted
CIE
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
121
click to vote
GLOBECOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
99
Voted
COCO
1995
Springer
15 years 5 months ago
1995
Springer
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...