Sciweavers

1145 search results - page 60 / 229
» Discrete Green's Functions
Sort
View
AAMAS
2011
Springer
15 years 1 months ago
Alternatives to truthfulness are hard to recognize
Abstract. The central question in mechanism design is how to implement a given social choice function. One of the most studied concepts is that of truthful implementations in which...
Vincenzo Auletta, Paolo Penna, Giuseppe Persiano, ...
TOG
2012
184views Communications» more  TOG 2012»
13 years 8 months ago
Point sampling with general noise spectrum
Point samples with different spectral noise properties (often defined using color names such as white, blue, green, and red) are important for many science and engineering discip...
Yahan Zhou, Haibin Huang, Li-Yi Wei, Rui Wang
ALENEX
2010
161views Algorithms» more  ALENEX 2010»
15 years 7 months ago
Route Planning with Flexible Objective Functions
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy...
Robert Geisberger, Moritz Kobitzsch, Peter Sanders
ICML
2010
IEEE
15 years 7 months ago
Efficient Reinforcement Learning with Multiple Reward Functions for Randomized Controlled Trial Analysis
We introduce new, efficient algorithms for value iteration with multiple reward functions and continuous state. We also give an algorithm for finding the set of all nondominated a...
Daniel J. Lizotte, Michael H. Bowling, Susan A. Mu...
COMGEO
2006
ACM
15 years 6 months ago
A new algorithmic approach to the computation of Minkowski functionals of polyconvex sets
An algorithm is proposed for the simultaneous computation of all Minkowski functionals (except for the volume) of sets from the convex ring in Rd discretized with respect to a give...
Simone Klenk, Volker Schmidt, Evgueni Spodarev