Sciweavers

1197 search results - page 180 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
CVPR
2005
IEEE
14 years 10 months ago
Robust L1 Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...
Qifa Ke, Takeo Kanade
TON
1998
68views more  TON 1998»
13 years 7 months ago
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
Abstract—The total transmission capacity required by a transport network to satisfy demand and protect it from failures contributes significantly to its cost, especially in long...
Rainer R. Iraschko, Mike H. MacGregor, Wayne D. Gr...
IROS
2006
IEEE
144views Robotics» more  IROS 2006»
14 years 2 months ago
Estimating Probability Distribution with Q-learning for Biped Gait Generation and Optimization
— A new biped gait generation and optimization method is proposed in the frame of Estimation of Distribution Algorithms (EDAs) with Q-learning method. By formulating the biped ga...
Lingyun Hu, Changjiu Zhou, Zengqi Sun
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 8 months ago
On Conditional Branches in Optimal Search Trees
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
Michael B. Baer
ICLP
1999
Springer
14 years 11 days ago
Logic Programming in Oz with Mozart
Oz is a multiparadigm language that supports logic programming as one of its major paradigms. A multiparadigm language is designed to support different programming paradigms (log...
Peter Van Roy