1331 search results - page 183 / 267 » Complexity bounds for zero-test algorithms |
109
click to vote
ICRA
1998
IEEE
15 years 7 months ago
1998
IEEE
An algorithm is presented which computes feasible manipulator trajectories along fixed paths in the presence of kinematic singularities. The resulting trajectories are close to mi...
173
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
151
click to vote
CONSTRAINTS
2008
15 years 3 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
133
click to vote
CSJM
2006
15 years 3 months ago
2006
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...
103
click to vote
JCM
2007
15 years 3 months ago
2007
— This paper deals with the problem of blind carrier-frequency offset (CFO) estimation in OFDM systems based on offset quadrature amplitude modulation (OFDM/OQAM) with null subca...