Sciweavers

3038 search results - page 111 / 608
» High-Speed Function Approximation
Sort
View
128
Voted
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
15 years 9 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
88
Voted
JMLR
2006
79views more  JMLR 2006»
15 years 2 months ago
Universal Kernels
In this paper we investigate conditions on the features of a continuous kernel so that it may approximate an arbitrary continuous target function uniformly on any compact subset o...
Charles A. Micchelli, Yuesheng Xu, Haizhang Zhang
134
Voted
SOFTWARE
2002
15 years 2 months ago
A Query-Driven Anytime Algorithm for Argumentative and Abductive Reasoning
Abstract. This paper presents a new approximation method for computing arguments or explanations in the context of logic-based argumentative or abductive reasoning. The algorithm c...
Rolf Haenni
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
16 years 2 months ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat
120
Voted
NIPS
2001
15 years 4 months ago
Multiagent Planning with Factored MDPs
We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication be...
Carlos Guestrin, Daphne Koller, Ronald Parr