Sciweavers

2343 search results - page 286 / 469
» The Locomotive Routing Problem
Sort
View
AAAI
2008
15 years 8 months ago
Maximum Entropy Inverse Reinforcement Learning
Recent research has shown the benefit of framing problems of imitation learning as solutions to Markov Decision Problems. This approach reduces learning to the problem of recoveri...
Brian Ziebart, Andrew L. Maas, J. Andrew Bagnell, ...
AAAI
1998
15 years 7 months ago
A* with Bounded Costs
A key assumption of all problem-solving approaches based on utility theory, including heuristic search, is that we can assign a utility or cost to each state. This in turn require...
Brian Logan, Natasha Alechina
EOR
2010
110views more  EOR 2010»
15 years 6 months ago
Online scheduling policies for multiclass call centers with impatient customers
We consider a call center with two classes of impatient customers: premium and regular classes. Modeling our call center as a multiclass GI/GI/s + M queue, we focus on developing ...
Oualid Jouini, Auke Pot, Ger Koole, Yves Dallery
INFOCOM
2012
IEEE
13 years 8 months ago
On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approxima
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
Tung-Wei Kuo, Ming-Jer Tsai
STACS
2007
Springer
16 years 10 days ago
Wavelength Management in WDM Rings to Maximize the Number of Connections
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
Ioannis Caragiannis