Sciweavers

908 search results - page 54 / 182
» Heuristic Methods for Solving Job-Shop Scheduling Problems
Sort
View
ATAL
2007
Springer
15 years 8 months ago
On opportunistic techniques for solving decentralized Markov decision processes with temporal constraints
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
Janusz Marecki, Milind Tambe
AAAI
1998
15 years 3 months ago
Solving Very Large Weakly Coupled Markov Decision Processes
We present a technique for computing approximately optimal solutions to stochastic resource allocation problems modeled as Markov decision processes (MDPs). We exploit two key pro...
Nicolas Meuleau, Milos Hauskrecht, Kee-Eung Kim, L...
CORR
2007
Springer
72views Education» more  CORR 2007»
15 years 1 months ago
A Heuristic Routing Mechanism Using a New Addressing Scheme
Current methods of routing are based on network information in the form of routing tables, in which routing protocols determine how to update the tables according to the network ch...
Mohsen Ravanbakhsh, Yasin Abbasi-Yadkori, Maghsoud...
ECAL
2007
Springer
15 years 8 months ago
Near-Optimal Mobile Robot Recharging with the Rate-Maximizing Forager
We examine the practical problem of a mobile autonomous robot performing a long-duration survey task, during which it must recharge its batteries periodically. We present a scalabl...
Jens Wawerla, Richard T. Vaughan
EOR
2006
120views more  EOR 2006»
15 years 1 months ago
Approximate and exact algorithms for the fixed-charge knapsack problem
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
Umit Akinc