Sciweavers

4430 search results - page 62 / 886
» Solving Optimization Problems with DLL
Sort
View
AIPS
2006
15 years 1 months ago
Solving Factored MDPs with Exponential-Family Transition Models
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
Branislav Kveton, Milos Hauskrecht
NN
2000
Springer
128views Neural Networks» more  NN 2000»
14 years 11 months ago
A recurrent neural network for solving linear projection equations
Linear projection equations arise in many optimization problems and have important applications in science and engineering. In this paper, we present a recurrent neural network fo...
Youshen Xia, Jun Wang
IJCGA
2006
79views more  IJCGA 2006»
14 years 11 months ago
Well-constrained Completion and Decomposition for under-constrained Geometric Constraint Problems
In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in suc...
Gui-Fang Zhang, Xiao-Shan Gao
MFCS
2010
Springer
14 years 10 months ago
Solving minones-2-sat as Fast as vertex cover
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Ra...
MP
2006
110views more  MP 2006»
14 years 11 months ago
Extending Scope of Robust Optimization: Comprehensive Robust Counterparts of Uncertain Problems
In this paper, we propose a new methodology for handling optimization problems with uncertain data. With the usual Robust Optimization paradigm, one looks for the decisions ensurin...
Aharon Ben-Tal, Stephen Boyd, Arkadi Nemirovski