Sciweavers

7129 search results - page 1012 / 1426
» Approximation Algorithms for Treewidth
Sort
View
CVIU
2007
154views more  CVIU 2007»
15 years 4 months ago
Bayesian stereo matching
A Bayesian framework is proposed for stereo vision where solutions to both the model parameters and the disparity map are posed in terms of predictions of latent variables, given ...
Li Cheng, Terry Caelli
169
Voted
ML
2008
ACM
152views Machine Learning» more  ML 2008»
15 years 4 months ago
Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
András Antos, Csaba Szepesvári, R&ea...
JSAT
2006
114views more  JSAT 2006»
15 years 4 months ago
Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...
Miguel F. Anjos
126
Voted
NAR
2008
73views more  NAR 2008»
15 years 4 months ago
LocalMove: computing on-lattice fits for biopolymers
Given an input Protein Data Bank file (PDB) for a protein or RNA molecule, LocalMove is a web server that determines an on-lattice representation for the input biomolecule. The we...
Yann Ponty, R. Istrate, E. Porcelli, Peter Clote
NCA
2008
IEEE
15 years 4 months ago
Neurodynamic programming: a case study of the traveling salesman problem
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
Jia Ma, Tao Yang, Zeng-Guang Hou, Min Tan, Derong ...
« Prev « First page 1012 / 1426 Last » Next »