1059 search results - page 58 / 212 » Improved Algorithms via Approximations of Probability Distri... |
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...
IJCAI
1997
14 years 11 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
State estimation consists of updating an agent’s belief given executed actions and observed evidence to date. In single agent environments, the state estimation can be formalize...
CCR
2006
14 years 9 months ago
2006
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
183
click to vote
ICDE
2000
IEEE
15 years 11 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...