Sciweavers

3875 search results - page 625 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
GECCO
2008
Springer
175views Optimization» more  GECCO 2008»
15 years 6 months ago
Using differential evolution for symbolic regression and numerical constant creation
One problem that has plagued Genetic Programming (GP) and its derivatives is numerical constant creation. Given a mathematical formula expressed as a tree structure, the leaf node...
Brian M. Cerny, Peter C. Nelson, Chi Zhou
CGF
2008
121views more  CGF 2008»
15 years 5 months ago
Tensor Clustering for Rendering Many-Light Animations
Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long-standing challenge. P...
Milos Hasan, Edgar Velázquez-Armendá...
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
15 years 11 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
ICCV
1999
IEEE
16 years 7 months ago
Stereo Reconstruction from Multiperspective Panoramas
A new approach to computing a panoramic (360 degrees) depth map is presented in this paper. Our approach uses a large collection of images taken by a camera whose motion has been c...
Heung-Yeung Shum, Richard Szeliski
ATAL
2010
Springer
15 years 6 months ago
Closing the learning-planning loop with predictive state representations
A central problem in artificial intelligence is to choose actions to maximize reward in a partially observable, uncertain environment. To do so, we must learn an accurate model of ...
Byron Boots, Sajid M. Siddiqi, Geoffrey J. Gordon