Sciweavers

2569 search results - page 25 / 514
» Approximate Objects and Approximate Theories
Sort
View
SAGT
2009
Springer
192views Game Theory» more  SAGT 2009»
15 years 6 months ago
Learning and Approximating the Optimal Strategy to Commit To
Computing optimal Stackelberg strategies in general two-player Bayesian games (not to be confused with Stackelberg strategies in routing games) is a topic that has recently been ga...
Joshua Letchford, Vincent Conitzer, Kamesh Munagal...
SIAMNUM
2010
140views more  SIAMNUM 2010»
14 years 6 months ago
Finite Element Approximation of the Linear Stochastic Wave Equation with Additive Noise
Semidiscrete finite element approximation of the linear stochastic wave equation with additive noise is studied in a semigroup framework. Optimal error estimates for the determinis...
Mihály Kovács, Stig Larsson, Fardin ...
105
Voted
TSDM
2000
151views Data Mining» more  TSDM 2000»
15 years 3 months ago
Rough Sets in Spatio-temporal Data Mining
In this paper I define spatio-temporal regions as pairs consisting of a spatial and a temporal component and I define topological relations between them. Using the notion of rough ...
Thomas Bittner
FCT
2007
Springer
15 years 6 months ago
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
15 years 6 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu