Sciweavers

9572 search results - page 303 / 1915
» Cover Algorithms and Their Combination
Sort
View
IJRR
2010
132views more  IJRR 2010»
15 years 3 months ago
LQR-trees: Feedback Motion Planning via Sums-of-Squares Verification
Advances in the direct computation of Lyapunov functions using convex optimization make it possible to efficiently evaluate regions of attraction for smooth nonlinear systems. Her...
Russ Tedrake, Ian R. Manchester, Mark Tobenkin, Jo...
147
Voted
TIT
2010
124views Education» more  TIT 2010»
15 years 1 months ago
Soft-input soft-output single tree-search sphere decoding
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The computational complexity of SISO detection often poses significant challenges for prac...
Christoph Studer, Helmut Bölcskei
195
Voted
AICT
2005
IEEE
194views Communications» more  AICT 2005»
16 years 9 days ago
Approximations to Maximum Weight Matching Scheduling Algorithms of Low Complexity
The choice of the scheduling algorithm is a major design criteria of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input queu...
Claus Bauer
IJCAI
1989
15 years 7 months ago
Rapid Retrieval Algorithms for Case-Based Reasoning
One of the major issues confronting case-based reasoning (CBR) is rapid retrieval of similar cases from a large case base. This paper describes three algorithms which address this...
Richard H. Stottler, Andrea L. Henke, James A. Kin...
NA
2008
144views more  NA 2008»
15 years 6 months ago
Another hybrid conjugate gradient algorithm for unconstrained optimization
Another hybrid conjugate gradient algorithm is subject to analysis. The parameter k is computed as a convex combination of HS k (Hestenes-Stiefel) and DY k (Dai-Yuan) algorithms, i...
Neculai Andrei