Sciweavers

810 search results - page 140 / 162
» Solving Time-Dependent Planning Problems
Sort
View
ANOR
2004
122views more  ANOR 2004»
13 years 7 months ago
Call Center Staffing with Simulation and Cutting Plane Methods
We present an iterative cutting plane method for minimizing staffing costs in a service system subject to satisfying acceptable service level requirements over multiple time perio...
Júlíus Atlason, Marina A. Epelman, S...
IAT
2010
IEEE
13 years 5 months ago
Getting What You Pay For: Is Exploration in Distributed Hill Climbing Really Worth it?
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...
Melanie Smith, Roger Mailler
AI
2011
Springer
13 years 2 months ago
A unifying action calculus
Abstract McCarthy’s Situation Calculus is arguably the oldest special-purpose knowledge representation formalism, designed to axiomatize knowledge of actions and their effects. ...
Michael Thielscher
ATAL
2006
Springer
13 years 11 months ago
Resource allocation among agents with preferences induced by factored MDPs
Distributing scarce resources among agents in a way that maximizes the social welfare of the group is a computationally hard problem when the value of a resource bundle is not lin...
Dmitri A. Dolgov, Edmund H. Durfee
AAMAS
2004
Springer
13 years 7 months ago
Autonomous Agents that Learn to Better Coordinate
A fundamental difficulty faced by groups of agents that work together is how to efficiently coordinate their efforts. This coordination problem is both ubiquitous and challenging,...
Andrew Garland, Richard Alterman