Sciweavers

408 search results - page 34 / 82
» A lookahead strategy for solving large planning problems
Sort
View
ICTAI
2005
IEEE
15 years 3 months ago
Planning with POMDPs Using a Compact, Logic-Based Representation
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...
Chenggang Wang, James G. Schmolze
CP
2010
Springer
14 years 7 months ago
Contingency Plans for Air Traffic Management
We present two heuristics based on constraint technology that solve the problem of generating air traffic management contingency plans, which are used in the case of a catastrophic...
Karl Sundequist Blomdahl, Pierre Flener, Justin Pe...
TRANSCI
2002
106views more  TRANSCI 2002»
14 years 9 months ago
The Stochastic Inventory Routing Problem with Direct Deliveries
Vendor managed inventory replenishment is a business practice in which vendors monitor their customers' inventories, and decide when and how much inventory should be replenis...
Anton J. Kleywegt, Vijay S. Nori, Martin W. P. Sav...
76
Voted
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
15 years 3 months ago
Absolute polynomial factorization in two variables and the knapsack problem
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
Guillaume Chèze
ATAL
2010
Springer
14 years 10 months ago
Point-based policy generation for decentralized POMDPs
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
Feng Wu, Shlomo Zilberstein, Xiaoping Chen