Sciweavers

1145 search results - page 95 / 229
» Discrete Green's Functions
Sort
View
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
16 years 10 days ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert
IROS
2007
IEEE
112views Robotics» more  IROS 2007»
16 years 21 days ago
Orchestrating concurrency in robot swarms
— A functional approach to programming robot swarms brings with it well-defined properties that allow for automated concurrency and distributed execution. Further, the particula...
Anthony Cowley, Camillo J. Taylor
AIPS
2006
15 years 7 months ago
Solving Factored MDPs with Exponential-Family Transition Models
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
Branislav Kveton, Milos Hauskrecht
WSC
2004
15 years 7 months ago
Simulation-Based Optimization Using Simulated Annealing With Confidence Interval
This paper develops a variant of Simulated Annealing (SA) algorithm for solving discrete stochastic optimization problems where the objective function is stochastic and can be eva...
Talal M. Alkhamis, Mohamed A. Ahmed
MOR
2006
95views more  MOR 2006»
15 years 6 months ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege