Sciweavers

3628 search results - page 170 / 726
» The Decision Diffie-Hellman Problem
Sort
View
NIPS
2007
15 years 4 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
EOR
2008
97views more  EOR 2008»
15 years 3 months ago
Optimization models for the single delay management problem in public transportation
Passengers travelling in public transportation networks often have to use different lines to cover the trip from their origin to the desired destination. As a consequence, the rel...
Géraldine Heilporn, Luigi De Giovanni, Mart...
104
Voted
IOR
2007
95views more  IOR 2007»
15 years 3 months ago
Index Policies for Shooting Problems
We consider a scenario in which a single Red wishes to shoot at a collection of Blue targets, one at a time, to maximise some measure of return obtained from Blues killed before R...
Kevin D. Glazebrook, Christopher Kirkbride, H. M. ...
ASC
2004
15 years 3 months ago
Solving nonconvex climate control problems: pitfalls and algorithm performances
Global optimization can be used as the main component for reliable decision support systems. In this contribution, we explore numerical solution techniques for nonconvex and nondi...
Carmen G. Moles, Julio R. Banga, Klaus Keller
JCSS
2010
112views more  JCSS 2010»
15 years 1 months ago
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
Nadja Betzler, Britta Dorn