Sciweavers

108 search results - page 3 / 22
» Approximation Via Value Unification
Sort
View
ICTAI
2006
IEEE
14 years 1 months ago
An Approximation to Mean-Shift via Swarm Intelligence
Mean shift based feature space analysis has been shown to be an elegant, accurate and robust technique. The elegance in this non-parametric algorithm is mainly due to its simplici...
Mani Thomas, Chandra Kambhamettu
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 4 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
14 years 17 days ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
SIAMCO
2008
96views more  SIAMCO 2008»
13 years 7 months ago
Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations
We consider the class of nonlinear optimal control problems (OCP) with polynomial data, i.e., the differential equation, state and control constraints and cost are all described by...
Jean B. Lasserre, Didier Henrion, Christophe Prieu...
AAAI
2006
13 years 8 months ago
Sample-Efficient Evolutionary Function Approximation for Reinforcement Learning
Reinforcement learning problems are commonly tackled with temporal difference methods, which attempt to estimate the agent's optimal value function. In most real-world proble...
Shimon Whiteson, Peter Stone