4894 search results - page 270 / 979 » The Guarding Problem - Complexity and Approximation |
180
click to vote
ATAL
2007
Springer
16 years 24 days ago
2007
Springer
We present a new method for carrying out state estimation in multiagent settings that are characterized by continuous or large discrete state spaces. State estimation in multiagen...
205
click to vote
SOFSEM
2007
Springer
16 years 22 days ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
206
click to vote
CBMS
2005
IEEE
16 years 7 days ago
2005
IEEE
In this work we introduce the new problem of finding time series discords. Time series discords are subsequences of longer time series that are maximally different to all the rest...
193
click to vote
STOC
1998
ACM
15 years 11 months ago
1998
ACM
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
176
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...