Sciweavers

12519 search results - page 222 / 2504
» Approximation Problems Categories
Sort
View
AI
2006
Springer
15 years 10 months ago
Partial Local FriendQ Multiagent Learning: Application to Team Automobile Coordination Problem
Real world multiagent coordination problems are important issues for reinforcement learning techniques. In general, these problems are partially observable and this characteristic ...
Julien Laumonier, Brahim Chaib-draa
UAI
2001
15 years 7 months ago
A Clustering Approach to Solving Large Stochastic Matching Problems
In this work we focus on efficient heuristics for solving a class of stochastic planning problems that arise in a variety of business, investment, and industrial applications. The...
Milos Hauskrecht, Eli Upfal
IPCO
1998
99views Optimization» more  IPCO 1998»
15 years 7 months ago
Non-approximability Results for Scheduling Problems with Minsum Criteria
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
Han Hoogeveen, Petra Schuurman, Gerhard J. Woeging...
ANOR
2007
165views more  ANOR 2007»
15 years 6 months ago
Financial scenario generation for stochastic multi-stage decision processes as facility location problems
The quality of multi-stage stochastic optimization models as they appear in asset liability management, energy planning, transportation, supply chain management, and other applicat...
Ronald Hochreiter, Georg Ch. Pflug
SIAMSC
2010
192views more  SIAMSC 2010»
15 years 4 months ago
Adaptive Discontinuous Galerkin Methods for Eigenvalue Problems Arising in Incompressible Fluid Flows
In this article we consider the a posteriori error estimation and adaptive mesh refinement of discontinuous Galerkin finite element approximations of the hydrodynamic stability p...
K. Andrew Cliffe, Edward J. C. Hall, Paul Houston