Sciweavers

530 search results - page 41 / 106
» A New Iterative Method for Solving Initial Value Problems
Sort
View
CP
2001
Springer
15 years 2 months ago
A CLP Approach to the Protein Side-Chain Placement Problem
Abstract. Selecting conformations for side-chains is an important subtask in building three-dimensional protein models. Side-chain placement is a difficult problem because of the l...
Martin T. Swain, Graham J. L. Kemp
ECCV
2004
Springer
15 years 3 months ago
A Probabilistic Approach to Large Displacement Optical Flow and Occlusion Detection
This paper deals with the computation of optical flow and occlusion detection in the case of large displacements. We propose a Bayesian approach to the optical flow problem and s...
Christoph Strecha, Rik Fransens, Luc J. Van Gool
CORR
2002
Springer
123views Education» more  CORR 2002»
14 years 9 months ago
Survey propagation: an algorithm for satisfiability
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
Alfredo Braunstein, Marc Mézard, Riccardo Z...
ICML
1999
IEEE
15 years 10 months ago
Distributed Value Functions
Many interesting problems, such as power grids, network switches, and tra c ow, that are candidates for solving with reinforcement learningRL, alsohave properties that make distri...
Jeff G. Schneider, Weng-Keen Wong, Andrew W. Moore...
79
Voted
CDC
2008
IEEE
112views Control Systems» more  CDC 2008»
15 years 4 months ago
Application of the proximal center decomposition method to distributed model predictive control
Abstract— In this paper we present a dual-based decomposition method, called here the proximal center method, to solve distributed model predictive control (MPC) problems for cou...
Ion Necoara, Dang Doan, Johan A. K. Suykens