Sciweavers

603 search results - page 112 / 121
» A General Approximation Technique for Constrained Forest Pro...
Sort
View
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
15 years 3 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
RSS
2007
119views Robotics» more  RSS 2007»
14 years 11 months ago
Emergent Task Allocation for Mobile Robots
— Multi-robot systems require efficient and accurate planning in order to perform mission-critical tasks. However, algorithms that find the optimal solution are usually computa...
Nuzhet Atay, O. Burçhan Bayazit
AAAI
2006
14 years 11 months ago
Action Selection in Bayesian Reinforcement Learning
My research attempts to address on-line action selection in reinforcement learning from a Bayesian perspective. The idea is to develop more effective action selection techniques b...
Tao Wang
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
15 years 9 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter
CDC
2009
IEEE
185views Control Systems» more  CDC 2009»
15 years 2 months ago
Discrete Empirical Interpolation for nonlinear model reduction
A dimension reduction method called Discrete Empirical Interpolation (DEIM) is proposed and shown to dramatically reduce the computational complexity of the popular Proper Orthogo...
Saifon Chaturantabut, Danny C. Sorensen