Sciweavers

1083 search results - page 155 / 217
» On the Number of Optimal Base 2 Representations of Integers
Sort
View
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
15 years 10 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
AAAI
2006
14 years 11 months ago
Incremental Least Squares Policy Iteration for POMDPs
We present a new algorithm, called incremental least squares policy iteration (ILSPI), for finding the infinite-horizon stationary policy for partially observable Markov decision ...
Hui Li, Xuejun Liao, Lawrence Carin
ICASSP
2011
IEEE
14 years 1 months ago
Collaborative sources identification in mixed signals via hierarchical sparse modeling
A collaborative framework for detecting the different sources in mixed signals is presented in this paper. The approach is based on CHiLasso, a convex collaborative hierarchical s...
Pablo Sprechmann, Ignacio Ramírez, Pablo Ca...
SI3D
2006
ACM
15 years 3 months ago
View-dependent precomputed light transport using nonlinear Gaussian function approximations
We propose a real-time method for rendering rigid objects with complex view-dependent effects under distant all-frequency lighting. Existing precomputed light transport approaches...
Paul Green, Jan Kautz, Wojciech Matusik, Fré...
GECCO
2008
Springer
186views Optimization» more  GECCO 2008»
14 years 11 months ago
A pareto following variation operator for fast-converging multiobjective evolutionary algorithms
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder, Michael Kirley, Ra...