Sciweavers

4047 search results - page 146 / 810
» The Discrete Basis Problem
Sort
View
MOR
2006
95views more  MOR 2006»
15 years 22 days ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege
108
Voted
KI
2007
Springer
15 years 19 days ago
Solving Decentralized Continuous Markov Decision Problems with Structured Reward
We present an approximation method that solves a class of Decentralized hybrid Markov Decision Processes (DEC-HMDPs). These DEC-HMDPs have both discrete and continuous state variab...
Emmanuel Benazera
MOC
1998
96views more  MOC 1998»
15 years 13 days ago
A convergence theorem for the fast multipole method for 2 dimensional scattering problems
Abstract. The Fast Multipole Method (FMM) designed by V. Rokhlin rapidly computes the field scattered from an obstacle. This computation consists of solving an integral equation o...
Christophe Labreuche
116
Voted
AMC
2011
14 years 7 months ago
Variational theory and domain decomposition for nonlocal problems
In this article we present the first results on domain decomposition methods for nonlocal operators. We present a nonlocal variational formulation for these operators and establi...
Burak Aksoylu, Michael L. Parks
102
Voted
AAAI
1998
15 years 2 months ago
On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph tra...
Fahiem Bacchus, Peter van Beek