Sciweavers

14386 search results - page 131 / 2878
» The Chinese Generals Problem
Sort
View
129
Voted
IPPS
1997
IEEE
15 years 7 months ago
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
Yuji Shinano, Kenichi Harada, Ryuichi Hirabayashi
97
Voted
JETAI
2002
57views more  JETAI 2002»
15 years 3 months ago
Contextualizing concepts using a mathematical generalization of the quantum formalism
We outline the rationale and preliminary results of using the State Context Property (SCOP) formalism, originally developed as a generalization of quantum mechanics, to describe t...
Liane Gabora, Diederik Aerts
147
Voted
TNN
2010
148views Management» more  TNN 2010»
14 years 10 months ago
Generalized low-rank approximations of matrices revisited
Compared to Singular Value Decomposition (SVD), Generalized Low Rank Approximations of Matrices (GLRAM) can consume less computation time, obtain higher compression ratio, and yiel...
Jun Liu, Songcan Chen, Zhi-Hua Zhou, Xiaoyang Tan
185
Voted
JMLR
2010
148views more  JMLR 2010»
14 years 10 months ago
A Generalized Path Integral Control Approach to Reinforcement Learning
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...
Evangelos Theodorou, Jonas Buchli, Stefan Schaal
103
Voted
DAM
2006
87views more  DAM 2006»
15 years 3 months ago
A new trust region technique for the maximum weight clique problem
A new simple generalization of the Motzkin
Stanislav Busygin