Sciweavers

327 search results - page 28 / 66
» Comparative News Summarization Using Linear Programming
Sort
View
IJHIS
2007
89views more  IJHIS 2007»
14 years 9 months ago
A new hybrid heuristic for driver scheduling
This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in...
Geraldo R. Mauri, Luiz Antonio Nogueira Lorena
ATAL
2008
Springer
14 years 11 months ago
Sigma point policy iteration
In reinforcement learning, least-squares temporal difference methods (e.g., LSTD and LSPI) are effective, data-efficient techniques for policy evaluation and control with linear v...
Michael H. Bowling, Alborz Geramifard, David Winga...
72
Voted
INFORMS
2000
128views more  INFORMS 2000»
14 years 9 months ago
A Revised Simplex Search Procedure for Stochastic Simulation Response Surface Optimization
We develop a variant of the Nelder-Mead (NM) simplex search procedure for stochastic simulation optimization that is designed to avoid many of the weaknesses encumbering such dire...
David G. Humphrey, James R. Wilson
ML
1998
ACM
117views Machine Learning» more  ML 1998»
14 years 9 months ago
Learning Team Strategies: Soccer Case Studies
We use simulated soccer to study multiagent learning. Each team's players (agents) share action set and policy, but may behave di erently due to position-dependent inputs. All...
Rafal Salustowicz, Marco Wiering, Jürgen Schm...
MST
2007
154views more  MST 2007»
14 years 9 months ago
Crown Structures for Vertex Cover Kernelization
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
Faisal N. Abu-Khzam, Michael R. Fellows, Michael A...